Skip to Main Content
The traditional map-matching algorithms mainly use two methods: the incremental method and the global method. Both of them have advantages and disadvantages of themselves: while the global map-matching algorithm produces better matching results, the incremental algorithm produces results of lower quality faster. All things considering the two traditional algorithms, this paper proposes a heuristic map-matching algorithm by using vector-based recognition. Firstly, the algorithm uses the heuristic search method which is similar to A* algorithm, and it makes use of geometric operation to form the restriction, and make the comparison between the vector formed with the vehicular GPS points and the special road network to heuristicly search and select the vehicular possible traveling routes. Secondly, it globally compares the vehicular every possible route by calculating the map-matching weight, and then chooses the optimal one. The result of testing demonstrates the efficiency of the algorithm both at accuracy and computational speed when handling the large-scale data of GPS tracking data even under the complex road network conditions.
Date of Conference: 4-9 March 2007