Enhancing Interactive Voting-Based Map Matching: Improving Efficiency and Robustness for Heterogeneous GPS Trajectories
William Alemanni, Arianna Burzacchi, Davide Colombi, Elena Giarratano

TL;DR
This paper enhances an interactive voting-based map matching algorithm to improve efficiency and robustness for heterogeneous GPS trajectories, enabling accurate reconstruction across diverse data qualities and regions.
Contribution
It introduces trajectory imputation, a distance-bounded voting strategy, and regional adaptability, extending the original algorithm's capabilities for real-world applications.
Findings
Improved accuracy in GPS trajectory reconstruction.
Reduced computational complexity through new voting strategy.
Enhanced applicability across different geographic regions.
Abstract
This paper presents an enhanced version of the Interactive Voting-Based Map Matching algorithm, designed to efficiently process trajectories with varying sampling rates. The main aim is to reconstruct GPS trajectories with high accuracy, independent of input data quality. Building upon the original algorithm, developed exclusively for aligning GPS signals to road networks, we extend its capabilities by integrating trajectory imputation. Our improvements also include the implementation of a distance-bounded interactive voting strategy to reduce computational complexity, as well as modifications to address missing data in the road network. Furthermore, we incorporate a custom-built asset derived from OpenStreetMap, enabling this approach to be smoothly applied in any geographic region covered by OpenStreetMap's road network. These advancements preserve the core strengths of the original…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
