Map Matching with Travel Time Constraints
Authors:
- 16 April 2007
- conference paper
- Published by SAE International in SAE International Journal of Advances and Current Practices in Mobility
- Vol. 1
Abstract
Map matching determines which road a vehicle is on based on inaccurate measured locations, such as GPS points. Simple algorithms, such as nearest road matching, fail often. We introduce a new algorithm that finds a sequence of road segments which simultaneously match the measured locations and which are traversable in the time intervals associated with the measurements. The time constraint, implemented with a hidden Markov model, greatly reduces the errors made by nearest road matching. We trained and tested the new algorithm on data taken from a large pool of real drivers.Keywords
This publication has 3 references indexed in Scilit:
- Some map matching algorithms for personal navigation assistantsTransportation Research Part C: Emerging Technologies, 2000
- Alternatives to the Median Absolute DeviationJournal of the American Statistical Association, 1993
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989