TIVMM: An effective map algorithm for low-sampling-rate GPS trajectories in road networks

In the process of map matching, we often encounter such a scenario. When there are two parallel paths between two points and the diver actually chooses the path that is longer. This scenario can be handled very well by high-sampling-rate based map matching algorithm. However, due to their limited energy budgets of the handheld GPS devices, they are more capable to provide low-sampling-rate trajectories. And the existing low-sampling-rate map matching algorithm cannot be applied directly to the scenario discussed before. Hence this paper proposes a Time Interactive Voting Map Matching (TIVMM) algorithm to resolve the problem. TIVMM algorithm considers the spatial geometry and topological structures of the road network, the speed constraints of the paths, the actual traveling time and the strength of the mutual influence. Extensive evaluations are performed and the results show that the proposed algorithm can provide higher accuracy compared to the existing approaches.

[1]  Thambipillai Srikanthan,et al.  Probabilistic Map Matching of Sparse and Noisy Smartphone Location Data , 2015, 2015 IEEE 18th International Conference on Intelligent Transportation Systems.

[2]  Simon Washington,et al.  Shortest path and vehicle trajectory aided map-matching for low frequency GPS data , 2015 .

[3]  Xing Xie,et al.  An Interactive-Voting Based Map Matching Algorithm , 2010, 2010 Eleventh International Conference on Mobile Data Management.

[4]  Chengyang Zhang,et al.  Map-matching for low-sampling-rate GPS trajectories , 2009, GIS.

[5]  Alexandre M. Bayen,et al.  The Path Inference Filter: Model-Based Low-Latency Map Matching of Probe Vehicle Data , 2011, IEEE transactions on intelligent transportation systems (Print).

[6]  Zhiwei Wang,et al.  A Map Matching Algorithm to Eliminate Miscalculation Based on Low-Sample-Rate Data , 2014 .