Matching the high sampled trajectory with road networks based on path increment

被引：0
|
作者：
Wang H. [1 ]
Liu Y. [1 ]
Li S. [1 ]
Liang B. [1 ]
He Z. [1 ,2 ]
机构：
[1] School of Geosciences, Yangtze University, Wuhan
[2] School of Resource and Environmenta Sciences, Wuhan University, Wuhan
来源：
Cehui Xuebao/Acta Geodaetica et Cartographica Sinica | 2023年 / 52卷 / 02期
基金：
中国国家自然科学基金;
关键词：
complex road network; GNSS trajectory; high sampling frequency; increment; map matching;
D O I：
10.11947/j.AGCS.2023.20210513
中图分类号：
学科分类号：
摘要：
Aiming at matching the high sampled GNSS trajectory data with complex urban road networks, a matching method based on path increment is proposed. The method consists of two parts: combined filtering and incremental matching. Firstly, the road network is simplified through combined filtering, and then the matching process is carried out with the road paths as the increments. During the matching process at the intersection point, the similarity evaluation scheme integrating distance factor and curvature is adopted. In order to verify the effectiveness of the method, several high sampled trajectory data with different complexity are selected for experiments. The method is compared with two existing matching methods, including the curvedness feature constrained map matching method and hidden Markov model (HMM). The results show that the proposed method not only performs better in accuracy and efficiency, but also can suppress the occurrence of matching errors in various complex sections. © 2023 SinoMaps Press. All rights reserved.
引用
收藏
页码：329 / 340
页数：11
相关论文
共 35 条
  • [1] ZHENG Yu, Trajectory data mining: an overview, ACM Transactions on Intelligent Systems and Technology, 6, 3, pp. 1-41, (2015)
  • [2] WANG Hongyu, LI Jin, HOU Zhenshan, Et al., Research on parallelized real-time map matching algorithm for massive GPS data [J], Cluster Computing, 20, 2, pp. 1123-1134, (2017)
  • [3] GONG Yuejiao, CHEN En., ZHANG Xlnglin, Et al., Ant-Mapper: an ant colony-based map matching approach for trajectory-based applications, IEEE Transactions on Intelligent Transportation Systems, 19, 2, pp. 390-401, (2018)
  • [4] BERNSTEIN D, KORNHAUSER A., An introduction to map-matching for personal navigation assistants, (1996)
  • [5] BENTLEY J L, MAURER H A., Efficient worst-case data structures for range searching, Acta Informatica, 13, 2, pp. 155-168, (1980)
  • [6] QUDDUS M A, OCHIENG W Y, NOLAND R B., Current map-matching algorithms for transport applications
  • [7] state-of-the art and future research directions, Transportation Research Part C: Emerging Technologies, 15, 5, pp. 312-328, (2007)
  • [8] ALT H., EFRAT A, ROTE G, Et al., Matching planar maps, Journal of Algorithms, 49, 2, pp. 262-283, (2003)
  • [9] QUDDUS M A, OCHIENG W Y, ZHAO Lin, Et al., A general map matching algorithm for transport telematics apphcations, GPS Solutions, 7, 3, pp. 157-167, (2003)
  • [10] GREENFELD J S., Matching GPS observations to locations on a digital map[J], Transportation Research Board, 3, (2002)
1234