Open source map matching with Markov decision processes: A new method and a detailed benchmark with existing approaches

Abstract

Map matching is a widely used technology for mapping tracks to road networks. Typically, tracks are recorded using publicly available Global Navigation Satellite Systems, and road networks are derived from the publicly available OpenStreetMap project. The challenge lies in resolving the discrepancies between the spatial location of the tracks and the underlying road network of the map. Map matching is a combination of defined models, algorithms, and metrics for resolving these differences that result from measurement and map errors. The goal is to find routes within the road network that best represent the given tracks. These matches allow further analysis since they are freed from the noise of the original track, they accurately overlap with the road network, and they are corrected for impossible detours and gaps that were present in the original track. Given the ongoing need for map matching in mobility research, in this work, we present a novel map matching method based on Markov decision processes with Reinforcement Learning algorithms. We introduce the new Candidate Adoption feature, which allows our model to dynamically resolve outliers and noise clusters. We also incorporate an improved Trajectory Simplification preprocessing algorithm for further improving our performance. In addition, we introduce a new map matching metric that evaluates direction changes in the routes, which effectively reduces detours and round trips in the results. We provide our map matching implementation as Open Source Software (OSS) and compare our new approach with multiple existing OSS solutions on several public data sets. Our novel method is more robust to noise and outliers than existing methods and it outperforms them in terms of accuracy and computational speed.

A review of map-matching algorithms

“…. 124 [30] comes with an algorithm based on Markov decision processes combined with reinforcement learning algorithms and with a trajectory simplification algorithm. The algorithm evaluates direction changes in routes, which reduces detours and round trips in the results.…”