AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (818.9 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research paper | Open Access

Research on map matching algorithm based on priority rule for low sampling frequency vehicle navigation data

Zhishuo Liu1( )Dongxin Yao2Zhao Kuan2Wang Chun Fang3
Beijing Jiaotong University, Beijing, China
School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China
Henan Polytechnic, Jiaozuo, China
Show Author Information

Abstract

Purpose

There is a certain error in the satellite positioning of the vehicle. The error will cause the drift point of the positioning point, which makes the vehicle trajectory shift to the real road. This paper aims to solve this problem.

Design/methodology/approach

The key technology to solve the problem is map matching (MM). The low sampling frequency of the vehicle is far from the distance between adjacent points, which weakens the correlation between the points, making MM more difficult. In this paper, an MM algorithm based on priority rules is designed for vehicle trajectory characteristics at low sampling frequencies.

Findings

The experimental results show that the MM based on priority rule algorithm can effectively match the trajectory data of low sampling frequency with the actual road, and the matching accuracy is better than other similar algorithms, the processing speed reaches 73 per second.

Research limitations/implications

In the algorithm verification of this paper, although the algorithm design and experimental verification are considered considering the diversity of GPS data sampling frequency, the experimental data used are still a single source.

Originality/value

Based on the GPS trajectory data of the Ministry of Transport, the experimental results show that the accuracy of the priority-based weight-based algorithm is higher. The accuracy of this algorithm is over 98.1 per cent, which is better than other similar algorithms.

References

 

Blazquez, C.A. and Vonderohe, A.P. (2009), “Effects of controlling parameters on performance of a decision-rule map- matching algorithm”, Journal of Transportation Engineering, Vol. 135 No. 12, pp. 966-973.

 

Boucher, J.P., Marín, A.M.P. and Santolino, M. (2013), “Pay-as-you-drive insurance: the effect of the kilometers on the risk of accident”, Anales Del Instituto De Actuarios Españoles, Vol. 19, No. 3, pp. 135-154.

 
Goh, C.Y., Dauwels, J., Mitrovic, N., Asif, M.T., Oran, A. and Jaillet, P. (2012), “Online map-matching based on hidden markov model for real-time traffic sensing applications”, International IEEE Conference on Intelligent Transportation Systems, IEEE, Piscataway, NJ, pp. 776-781.https://doi.org/10.1109/ITSC.2012.6338627
 

Hashemi, M. and Karimi, H.A. (2016), “A weight-based map-matching algorithm for vehicle navigation in complex urban networks”, Journal of Intelligent Transportation Systems, Vol. 20 No. 6, pp. 573-590.

 

Liu, Y., Wu, J. and Zhang, G. (2007), “Research on map matching algorithm based on long interval large-scale data”, Journal of Transportation Engineering and Information, Vol. 5 No. 2, pp. 69-74.

 

Marchal, F., Hackney, J. and Axhausen, K.W. (2005), “Efficient map matching of large global positioning system data sets: tests on speed-monitoring experiment in Zürich”, Transportation Research Record Journal of the Transportation Research Board, Vol. 1935 No. 1, pp. 93-100.

 

Ming, R. and Karimi, H.A. (2009), “A hidden markov model-based map-matching algorithm for wheelchair navigation”, Journal of Navigation, Vol. 62 No. 3, pp. 383-395.

 
Mokhtari, K.E., Reboul, S., Azmani, M., Choquel, J.B., Hamdoune, S., Amami, B. and Benjelloun, M. (2014), “A map matching algorithm based on a particle filter”, International Conference on Multimedia Computing and Systems, IEEE, Piscataway, NJ, pp. 723-727.https://doi.org/10.1109/ICMCS.2014.6911291
 

Ollero, H.J. (2007), “Relationships between crash involvement and temporal-spatial driving behavior activity patterns: use of data for vehicles with global positioning systems”, Transportation Research Record Journal of the Transportation Research Board, Vol. 2019 No. 2019, pp. 246-255.

 

Paefgen, J., Staake, T. and Fleisch, E. (2014), “Multivariate exposure modeling of accident risk: insights from pay-as-you- drive insurance data”, Transportation Research Part A, Vol. 61 No. 3, pp. 27-40.

 

Perrine, K., Khani, A. and Juri, N.R. (2016), “Map-matching algorithm for applications in multimodal transportation network modeling”, Transportation Research Record Journal of the Transportation Research Board, Vol. 2537 No. 1, pp. 847-852.

 

Quddus, M. and Washington, S. (2015), “Shortest path and vehicle trajectory aided map-matching for low frequency GPS data”,Transportation Research Part C, Vol. 55, pp. 328-339.

 
Raymond, R., Morimura, T., Osogami, T. and Hirosue, N. (2012), “Map matching with hidden markov model on sampled road network”, International Conference on Pattern Recognition, IEEE, Piscataway, NJ, pp. 2242-2245.
International Journal of Crowd Science
Pages 2-13
Cite this article:
Liu Z, Yao D, Kuan Z, et al. Research on map matching algorithm based on priority rule for low sampling frequency vehicle navigation data. International Journal of Crowd Science, 2019, 3(1): 2-13. https://doi.org/10.1108/IJCS-01-2019-0001

560

Views

17

Downloads

0

Crossref

0

Scopus

Altmetrics

Received: 15 January 2019
Accepted: 05 March 2019
Published: 16 April 2019
© The author(s)

Zhishuo Liu, Dongxin Yao, Zhao Kuan and Wang Chun Fang. Published in International Journal of Crowd Science. Published by Emerald Publishing Limited. This article is published under the Creative Commons Attribution (CC BY 4.0) licence. Anyone may reproduce, distribute, translate and create derivative works of this article (for both commercial and non-commercial purposes), subject to full attribution to the original publication and authors. The full terms of this licence may be seen at http://creativecommons.org/licences/by/4.0/legalcode

Return