This content is not included in
your SAE MOBILUS subscription, or you are not logged in.
Map Matching with Travel Time Constraints
Technical Paper
2007-01-1102
ISSN: 0148-7191, e-ISSN: 2688-3627
Annotation ability available
Sector:
Language:
English
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.
Authors
Citation
Krumm, J., Horvitz, E., and Letchner, J., "Map Matching with Travel Time Constraints," SAE Technical Paper 2007-01-1102, 2007, https://doi.org/10.4271/2007-01-1102.Also In
References
- White C.E. Bernstein D. Kornhauser A.L. Some Map Matching Algorithms for Personal Navigation Assistants. Transportation Research Part C 2000 8 91 108
- Hummel B. Map Matching for Vehicle Guidance , in Dynamic and Mobile GIS: Investigating Space and Time Drummond J. Billen R. 2006 CRC Press Florida
- Krumm J. Horvitz E. The Microsoft Multiperson Location Survey 2005 Microsoft Research (MSR-TR-2005-103) Redmond WA USA
- Diggelen F.v. GPS Accuracy: Lies Damn Lies, and Statistics GPS World 1998 41 45
- Rousseeuw P.J. Croux C. Alternatives to the Median Absolute Deviation. Journal of the Americal Statistical Association 1993 88 424 1273 1283
- Rabiner L.R. A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proceedings of the IEEE 1989 77 2 257 286