Abstract

A myriad of connected vehicles collects large-scale telematics data throughout cities, enabling data-based infrastructure planning. To truly benefit from this emerging technology, it is important to integrate pervasive telematics data with map data to produce more tractable and readable information for traffic flows and safety. Map-matching algorithms enable the projection of noisy trajectory data onto map data as a means of integrating telematics data. However, map-matching poses challenges due to higher levels of positioning errors and complex road networks. The authors propose a novel map-matching algorithm that can fuse in-vehicle data with trajectory data to improve the efficiency and accuracy of the algorithm. The proposed algorithm combines the probabilistic and weight-based map-matching frameworks. The novelty of the proposed algorithm includes (i) an adaptive segment candidate search mechanism based on in-vehicle speed information, (ii) adaptive matching parameters to reflect the variations in the Global Positioning System (GPS) noise levels, (iii) a novel transition probability that uses in-vehicle speed data, and (iv) a backend data query system for the shortest routes. Map-matching results were validated based on ground-truth data collected using an in-vehicle sensing device developed by the authors, as well as comparing with a commonly-used off-the-shelf map-matching platform. The proposed algorithm is proven to be robust, with an accuracy of 97.45%, particularly where map data are denser and GPS noise is high.

Full Text
Paper version not known

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 call

Disclaimer: 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.