Journal of System Simulation ›› 2023, Vol. 35 ›› Issue (2): 339-349.doi: 10.16182/j.issn1004731x.joss.21-1020

• Papers • Previous Articles     Next Articles

Efficient HMM Map Matching Method Using R-tree and Trajectory Segmentation

Yanjiao Song1(), Jiayue Zhou1, Longhao Wang1, Jing Wu1, Rui Li1, Xiaoping Rui2()   

  1. 1.College of Hydrology and Water Resources, Hohai University, Nanjing 210098, China
    2.School of Earth Sciences and Engineering, Hohai University, Nanjing 211100, China
  • Received:2021-10-04 Revised:2021-12-21 Online:2023-02-28 Published:2023-02-16
  • Contact: Xiaoping Rui E-mail:songyanjiao2000@163.com;ruixpsz@163.com

Abstract:

In view of the incapability of traditional methods to efficiently process massive trajectory data, an improved HMM (hidden-Markov model) map matching algorithm is proposed. Spatial index for road networks is established through R-tree spatial index. GPS trajectory data are segmented based on the position change rates of trajectory points. R-tree index is used to quickly determine the candidate road section that sub-trajectories belong to, and the key points of the sub-trajectories instead of the entire sub-trajectories are selected to judge which road the sub-trajectories should be matched with. The map matching of each sub-trajectory is carried out on the basis of the former results. The algorithm is verified by a simulation experiment using Beijing's floating car data and OpenStreetMap data. Experimental result shows that the proposed algorithm can reduce the workload of road search and trajectory point traversal and can greatly improve the algorithmic efficiency.

Key words: hidden-Markov model, map matching, R-tree, trajectory segmentation, GPS trajectory data, road networks

CLC Number: