A map-matching algorithm with low-frequency floating car data based on matching path

13Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the wide application and rapid development of Intelligent Transportation System (ITS), the floating car has been widely used in the collection of traffic information, which is also very important in the application of the wireless sensor networks. In addition to the high-frequency floating car, energy-saving low-frequency floating car has attracted great attention, but the low-frequency GPS data have a poor effect on map matching. Taking consideration of the distance, direction, speed, and topology of road and vehicle, we propose a global map matching algorithm with low-frequency floating car data based on the matching path. The proposed algorithm preprocesses the floating car data and road network data to determine the potential points and sections by constructing the error region. Then, we calculate the potential matching path graph with the analysis of time and space. Finally, we can obtain the matching result by parallel computing with section division methodology. The experiment results demonstrate that the proposed map-matching algorithm can improve the running time and matching accuracy compared with the existing methods.

Cite

CITATION STYLE

APA

Yuan, L., Li, D., & Hu, S. (2018). A map-matching algorithm with low-frequency floating car data based on matching path. Eurasip Journal on Wireless Communications and Networking, 2018(1). https://doi.org/10.1186/s13638-018-1154-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free