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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Map Matching with Travel Time Constraints


    Additional title:

    Sae Technical Papers


    Contributors:

    Conference:

    SAE World Congress & Exhibition ; 2007



    Publication date :

    2007-04-16




    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    Map matching with travel time constraints

    Krumm,J. / Horvitz,E. / Letcher,J. et al. | Automotive engineering | 2007


    Map Matching with Travel Time Constraints

    Krumm, J. / Horvitz, E. / Letchner, J. et al. | British Library Conference Proceedings | 2007


    2007-01-1102 Map Matching with Travel Time Constraints

    Krumm, J. / Horvitz, E. / Letchner, J. | British Library Conference Proceedings | 2007


    Time constraints and travel behaviour

    Metz, David | Taylor & Francis Verlag | 2021


    Travel time constraints in transport policy

    Metz, D. | Online Contents | 2004