An incremental map-matching algorithm based on hidden Markov model

24Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Map-matching algorithms aim at establishing a vehicle location on a road segment based on positioning data from a variety of sensors: GPS receivers, WiFi or cellular radios. They are integral part of various Intelligent Transportation Systems (ITS) including fleet management, vehicle tracking, navigation services, traffic monitoring and congestion detection. Our work was motivated by an idea of developing an algorithm that can be both utilized for tracking individual vehicles and for monitoring traffic in real-time. We propose a new incremental map-matching algorithm that constructs of a sequence of Hidden-Markov Models (HMMs). Starting from an initial HMM, the next models are developed by alternating operations: expansion and contraction. In the later, the map-matched trace is output. We discuss results of initial experiments conducted for 20 GPS traces, which to test algorithm robustness, were modified by introduction of noise and/or downsampled. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Szwed, P., & Pekala, K. (2014). An incremental map-matching algorithm based on hidden Markov model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8468 LNAI, pp. 579–590). Springer Verlag. https://doi.org/10.1007/978-3-319-07176-3_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free