Abstract
Based on analyzing the factors of affecting real-time performance, robustness, and matching precision of the map matching algorithm, and according to the continuity of the vehicle movement, the idea of partitioning the road net into some grids is introduced. Using the information about the position and the direction of the vehicle running and the topological feature of the road network, a quick map matching algorithm, of which the time complexity is O(c), is proposed. Simulating results aimed at the practical running data show that the correct rate about the new algorithm is no less than 95% and the matching time for the individual positioning point is less than 0.01 ms.
| Original language | English |
|---|---|
| Pages (from-to) | 225-229 |
| Number of pages | 5 |
| Journal | Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology |
| Volume | 25 |
| Issue number | 3 |
| Publication status | Published - Mar 2005 |
Keywords
- Map matching
- Road net partition
- Vehicle navigation system