Acceleration of Map Matching for Floating Car Data by Exploiting Travelling Velocity

In this paper, we present a novel speedup technique for Floating Car Data (FCD) map matching which exploits the upper bound of driving distance between two adjacent track points. The traveling speed of floating car can be employed for estimating the upper bound, which can restrict the computational magnitude of all pairs shortest paths to the acceptable extent in the preprocessing stage. The overhead for shortest paths between adjacent track points, which is a major part of online map matching, can be greatly reduced by querying the results from the preprocessing stage. The proposed method can hasten massive FCD map matching to achieve real time high-performance and be easily integrated into on-line map matching methods.