基于位置的可拼接轨迹对搜索  

Splicing Trajectory Pairs Search Based on Location

作　　者：陈子军[1,2] 张静 刘文远 刘永山[1,2] CHEN Zi-jun;ZHANG Jing;LIU Wen-yuan;LIU Yong-shan(School of Information Science and Engineering,Yanshan University,Qinhuangdao,Hebei 066004,China;The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province,Qinhuangdao,Hebei 066004,China)

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004 [2]河北省计算机虚拟技术与系统集成重点实验室,河北秦皇岛066004

出　　处：《北京理工大学学报》2019年第3期262-268,共7页Transactions of Beijing Institute of Technology

基　　金：河北省自然科学基金资助项目(F2017203019)

摘　　要：移动设备的快速发展,生成了大量轨迹.基于位置的轨迹搜索,是指给定一组查询点,从数据集中检索top-k条轨迹,但是所得到的轨迹可能不能近距离通过所有查询点.利用轨迹可拼接的想法,提出基于位置的可拼接轨迹对搜索,使用户利用轨迹对得到的轨迹更加近距离地通过所有查询点.在搜索终止过程,给出可拼接的轨迹对搜索过程的有效终止条件.真实的数据集验证了所提方法的有效性.With the proliferation of mobile devices, a large number of trajectories are generated. Location-based trajectory search is to find the top- k trajectories from a database, given a small set of locations. However, the returned trajectory may not go through all locations as close as possible. Location-based splicing trajectories pair search was proposed based on the idea that trajectory could be spliced to help users to get closer trajectory to all the query points. In the termination of search process, an effective termination condition of the search process was given for splicing trajectory pairs. At last, the effectiveness and efficiency of the proposed algorithm were verified based on the real data set.

关 键 词：轨迹搜索 R-TREE 轨迹拼接 k-NN搜索 

分 类 号：TN919.3[电子电信—通信与信息系统]