.png){kind=icon}
.png){kind=icon}
Return
High-Frequency Trajectory Map Matching Algorithm Based on Road Network Topology
.png){kind=icon}
PRE
AI
DOI：10.1109/TITS.2022.3155689.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Accurately mapping the raw global position system (GPS) trajectories to the road network is the basis for studying the application of trajectory data. This study proposes a novel off-line map matching algorithm based on road network topology, to address the problems of low execution efficiency and poor matching accuracy of selective look-ahead map matching (SLAMM) algorithm. First, the noise points of the trajectory data are removed by data preprocessing. Second, the algorithm searches for critical samples in the trajectory data and segments the data accordingly. Then, the adjacent road segments around the transition node corresponding to the critical sample are selected as candidate arcs. Finally, the segmented trajectory data are matched to the road network by constructing an error ellipse. The algorithm fully considers the topology of the road network and the characteristics of high-frequency trajectory data. The experimental results, using Beijing trajectory data to perform matching on an actual road network environment, show that the proposed algorithm is more efficient and robust than other map matching algorithms for high-frequency trajectories.
Keywords:
Trajectory
Roads
Hidden Markov models
Network topology
Global Positioning System
Topology
Clustering algorithms
High-frequency trajectory
map matching
road network topology
vehicle trajectory
Journal
IF:
8.4
Papers:
9.5K
Citations:
6.3W