Deriving Network-Constrained Trajectories from Sporadic Tracking Points Collected in Location-Based Services  

一个从基于位置相关服务而收集的零星位置点中获取连续车辆轨迹的方法(英文)

作　　者：李响 张喜慧 林珲 

机构地区：[1]Key Laboratory of Geographic Information Science, Ministry of Education, East China Normal University

出　　处：《Geo-Spatial Information Science》2009年第2期85-94,共10页地球空间信息科学学报（英文）

基　　金：Supported by the National Natural Science Foundation of China (No40701142);the Scientific Research Starting Foundation for Returned Overseas Chinese Scholars, Ministry of Education, China

摘　　要：The paper proposes an economical and fast algorithm for deriving trajectories from sporadic tracking points collected in location-based services (LBS). Although many traffic studies or applications can benefit from the derived trajectories, the sporadic tracking points are always implicitly overlooked by most of existing map-matching algorithms. The algorithm proposed in this paper finds network paths or trajectories traveled by vehicles through augmenting GPS data with odometer data. An odometer can provide data of traveled distance which are compared with the lengths of candidate network paths in order to find the most approximate network path approaching the trajectory of a vehicle. Tracking points are classified into anchor points and non-anchor points. The former are used to divide trajectories, and the latter screen candidate network paths. An elliptic selection zone and a reduction process are applied to the selection of possible road segments composing candidate network paths. A brute-force searching algorithm is developed to find candidate network paths and calculate their lengths. A two-step screening process is designed to select the final result from candidate network paths. Finally, a series of experiments are conducted to validate the proposed algorithm.The paper proposes an economical and fast algorithm for deriving trajectories from sporadic tracking points collected in location-based services （LBS）. Although many traffic studies or applications can benefit from the derived trajectories, the sporadic tracking points are always implicitly overlooked by most of existing map-matching algorithms. The algorithm proposed in this paper finds network paths or trajectories traveled by vehicles through augmenting GPS data with odometer data. An odometer can provide data of traveled distance which are compared with the lengths of candidate network paths in order to find the most approximate network path approaching the trajectory of a vehicle. Tracking points are classified into anchor points and non-anchor points. The former are used to divide trajectories, and the latter screen candidate network paths. An elliptic selection zone and a reduction process are applied to the selection of possible road segments composing candidate network paths. A brute-force searching algorithm is developed to find candidate network paths and calculate their lengths. A two-step screening process is designed to select the final result from candidate network paths. Finally, a series of experiments are conducted to validate the proposed algorithm.

关 键 词：LBS GPS TRAJECTORY ODOMETER tracking point map-matching algorithm 

分 类 号：P208[天文地球—地图制图学与地理信息工程] P228.4[天文地球—测绘科学与技术]