A Virtual Differential Map-Matching Algorithm with Improved Accuracy and Computational Efficiency

2008 ◽  
Vol 61 (3) ◽  
pp. 421-434 ◽  
Author(s):  
Hongchao Liu ◽  
Hao Xu ◽  
H. Scott Norville ◽  
Yuanlu Bao

This paper presents development and application of a real-time virtual differential map-matching approach which makes use of the slow drifting property of the GPS errors and the continuous and gradual evolving characteristic of map errors to improve the accuracy and computational efficiency. A differential vector is created to approximate the real-time deviation, which is corrected continuously along with the vehicle movement during the map-matching process. Real-life application of the algorithm to the City of Hefei, a metropolis of China, shows that it corrects both GPS errors and digital map errors reasonably well with improved computational efficiency.

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

2019 ◽  
Vol 534 ◽  
pp. 122318 ◽  
Author(s):  
Mujun He ◽  
Linjiang Zheng ◽  
Wei Cao ◽  
Jing Huang ◽  
Xu Liu ◽  
...  

ORiON ◽  
2019 ◽  
Vol 35 (1) ◽  
pp. 1-31
Author(s):  
JB Vosloo ◽  
JW Joubert

The rapid development and proliferation of global positioning system (GPS)-enabled systems and devices have led to a significant increase in the availability of transport data, more specifically GPS trajectories, that can be used in researching vehicle activities. In order to save data storage- and handling costs many vehicle tracking systems only store low-frequency trajectories for vehicles. A number of existing methods used to map GPS trajectories to a digital road network were analysed and such an algorithm was implemented in Multi-Agent Transport Simulation (MATSim), an open source collaborative simulation package for Java. The map-matching algorithm was tested on a simple grid network and a real and extensive network of the City of Cape Town, South Africa. Experimentation showed the network size has the biggest influence on algorithm execution time and that a network must be reduced to include only the links that the vehicle most likely traversed. The algorithm is not suited for trajectories with sampling rates less than 5 seconds as it can result in unrealistic paths chosen, but it manages to obtain accuracies of around 80% up until sampling sizes of around 50 seconds whereafter the accuracy decreases. Further experimentation also revealed optimal algorithm parameters for matching trajectories on the Cape Town network. The use case for the implementation was to infer basic vehicle travel information, such as route travelled and speed of travel, for municipal waste collection vehicles in the City of Cape Town, South Africa.


2019 ◽  
Vol 45 (4) ◽  
pp. 2587-2603 ◽  
Author(s):  
Saravjeet Singh ◽  
Jaiteg Singh ◽  
Sukhjit Singh Sehra

Sign in / Sign up

Export Citation Format

Share Document