Map Matching Algorithm Based on Dynamic Programming Approach

GPS sensors embedded in almost all mobile devices and vehicles generate a large amount of data that can be used in both practical applications and transportation research. Despite the high accuracy of location measurements in 3-5 meters on average, this data can not be used for practical use without preprocessing. The preprocessing step that is needed to identify the correct path as a sequence of road segments by a series of location measurements and road network data is called map matching. In this paper, we consider the offline map matching problem in which the whole trajectory is processed after it has been collected. We propose a map matching algorithm based on a dynamic programming approach. The experimental studies on the dataset collected in Samara, Russia, showed that the proposed algorithm outperforms other comparable algorithms in terms of accuracy.