POMM: Precise Overpass Map-Matching Model and Algorithm

2012 ◽  
Vol 457-458 ◽  
pp. 1213-1218 ◽  
Author(s):  
Zhen Xing Zhu ◽  
Jian Ping Xing ◽  
De Qiang Wang

Current map-matching algorithms consider more about the common plain road networks. The overpass always be ignored or treated as normal intersection without considering its complex topological structure. In order to fill this gap in map-matching area, the POMM (Precise Overpass Map-matching Model and Algorithm) is proposed in this paper. A novel overpass model is built for the overpasses map-matching algorithm. This model divided the overpass into straight roads and curve ones which consist of a set of directional points. According to the match degree for each straight road or directional point, the optimum road can be selectd from the candidate roads. Finally, the vehicle can be matched to the actual position on the optimum road. Experiment results of Jinan Bayi overpass using the actual GPS data shows that the algorithm has efficiency in accuracy (over 95%) and can precisely find the actual position of the vehicle in the overpass road, especially for the curve roads.

2021 ◽  
Vol 565 ◽  
pp. 32-45
Author(s):  
Dongqing Zhang ◽  
Yucheng Dong ◽  
Zhaoxia Guo

2017 ◽  
Vol 20 (2) ◽  
pp. 1123-1134 ◽  
Author(s):  
Hongyu Wang ◽  
Jin Li ◽  
Zhenshan Hou ◽  
Ruochen Fang ◽  
Wenbo Mei ◽  
...  

2014 ◽  
Vol 556-562 ◽  
pp. 3227-3233
Author(s):  
Chao Zhang ◽  
Zhi Bin Ren ◽  
Hui Qi ◽  
Jun Hong Meng ◽  
Da Wei

With regard to the map matching algorithm based on central navigation, the network data are downloaded according to the GPS data in real time. For this reason a network data transport protocol based on grid storage is designed. The paper discusses map matching algorithm on two cases according to having matching point or not. At last, a running experiment for map matching algorithm is given.


Author(s):  
Lei Zhu ◽  
Jacob R. Holden ◽  
Jeffrey D. Gonder

With the development of smartphones and portable GPS devices, large-scale, high-resolution GPS data can be collected. Map matching is a critical step in studying vehicle driving activity and recognizing network traffic conditions from the data. A new trajectory segmentation map-matching algorithm is proposed to deal accurately and efficiently with large-scale, high-resolution GPS trajectory data. The new algorithm separated the GPS trajectory into segments. It found the shortest path for each segment in a scientific manner and ultimately generated a best-matched path for the entire trajectory. The similarity of a trajectory segment and its matched path is described by a similarity score system based on the longest common subsequence. The numerical experiment indicated that the proposed map-matching algorithm was very promising in relation to accuracy and computational efficiency. Large-scale data set applications verified that the proposed method is robust and capable of dealing with real-world, large-scale GPS data in a computationally efficient and accurate manner.


PLoS ONE ◽  
2017 ◽  
Vol 12 (12) ◽  
pp. e0188796 ◽  
Author(s):  
Jinjun Tang ◽  
Shen Zhang ◽  
Yajie Zou ◽  
Fang Liu

Sign in / Sign up

Export Citation Format

Share Document