Szczegóły publikacji
Opis bibliograficzny
An incremental map-matching algorithm based on Hidden Markov Model / Piotr SZWED, Kamil Pekala // W: Artificial Intelligence and Soft Computing : 13th International Conference, ICAISC 2014 : Zakopane, Poland, June 1–5, 2014 : proceedings, Pt. 2 / eds. Leszek Rutkowski, [et al.]. — Cham, [etc.] : Springer, cop. 2014. — (Lecture Notes in Computer Science ; ISSN 0302-9743. Lecture Notes in Artificial Intelligence ; 8468). — ISBN: 978-3-319-07175-6; e-ISBN: 978-3-319-07176-3. — S. 579–590. — Bibliogr. s. 589–590, Abstr.
Autorzy (2)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 81935 |
|---|---|
| Data dodania do BaDAP | 2014-06-24 |
| DOI | 10.1007/978-3-319-07176-3_51 |
| Rok publikacji | 2014 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | International Conference on Artificial Intelligence and Soft Computing 2014 |
| Czasopismo/seria | Lecture Notes in Computer Science |
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.
