| 一个从基于位置相关服务而收集的零星位置点中获取连续车辆轨迹的方法(英文) |
| |
| 引用本文： | 李响,张喜慧,林珲.一个从基于位置相关服务而收集的零星位置点中获取连续车辆轨迹的方法(英文)[J].地球空间信息科学学报,2009,12(2):85-94. |
| |
| 作者姓名： | 李响 张喜慧 林珲 |
| |
| 作者单位： | Laboratory;Geographic;Information;Science;Ministry;Education;East;China;Normal;University; |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China (No40701142);;the Scientific Research Starting Foundation for Returned Overseas Chinese Scholars, Ministry of Education, China |
| |
| 摘 要： |
|
| 关 键 词： | 轨迹 位置相关 收集 星位置 车辆 服务 获取 连续 |
| 收稿时间： | 4 June 2003 |
Deriving network-constrained trajectories from sporadic tracking points collected in location-based services |
| |
| Xiang Li,Xihui Zhang,Hui Lin.Deriving network-constrained trajectories from sporadic tracking points collected in location-based services[J].Geo-Spatial Information Science,2009,12(2):85-94. |
| |
| Authors: | Xiang Li Xihui Zhang Hui Lin |
| |
| Institution: | (1) Key Laboratory of Geographic Information Science, Ministry of Education, East China Normal University, 3663 N. Zhongshan Road, Shanghai, 200062, China |
| |
| Abstract: | 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.
Supported by the National Natural Science Foundation of China (No.40701142), the Scientific Research Starting Foundation for
Returned Overseas Chinese Scholars, Ministry of Education, China. |
| |
| Keywords: | LBS GPS trajectory odometer tracking point map-matching algorithm |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
