Map matching is a key preprocess of trajectory data which recently have become a major data source for various transport applications and location-based services. In this paper, an online map matching algorithm based on the second-order hidden Markov model (HMM) is proposed for processing trajectory data in complex urban road networks such as parallel road segments and various road intersections. Several factors such as driver’s travel preference, network topology, road level, and vehicle heading are well considered. An extended Viterbi algorithm and a self-adaptive sliding window mechanism are adopted to solve the map matching problem efficiently. To demonstrate the effectiveness of the proposed algorithm, a case study is carried out using a massive taxi trajectory dataset in Nanjing, China. Case study results show that the accuracy of the proposed algorithm outperforms the baseline algorithm built on the first-order HMM in various testing experiments.


    Access

    Download


    Export, share and cite



    Title :

    An Online Map Matching Algorithm Based on Second-Order Hidden Markov Model


    Contributors:
    Xiao Fu (author) / Jiaxu Zhang (author) / Yue Zhang (author)


    Publication date :

    2021




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    A Simple Aerial Map Matching Algorithm Based on Hidden Markov

    Gu, Xin / Xiang, Qiao-Jun / Ma, Yong et al. | ASCE | 2018



    Online map-matching based on Hidden Markov model for real-time traffic sensing applications

    Goh, C. Y. / Dauwels, Justin H. G. / Mitrovic, Nikola et al. | DSpace@MIT | 2012

    Free access

    Map-Matching Algorithm Based on Hidden Markov and Constraint Value Pruning

    Mei, Bai / Yujing, Niu / Chunye, Li et al. | Transportation Research Record | 2024