Abstract
The traditional map matching algorithms consider little about the complicated structure of the road network, and regard all roads as the same. However, in the transportation information system using the floating car data (FCD), the GPS sampling rate is low, and it is probable to figure out the incorrect result when the vehicle is in the intersection area. To solve this problem, this paper proposes a bidirectional heuristic map matching algorithm for intersections based on a data structure for intersections. This algorithm apply the data structure of intersections to separates the intersection part from common map matching, decreases the FCD map matching mistakes that caused by the complicated road network and the GPS errors, and increases the accuracy of map matching.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
