This article proposes a batch-mode algorithm to handle the large databases generated from experimentations using probe vehicles. This algorithm can locate raw Global Positioning System (GPS) positions on a map, but can also be used to correct map-matching errors introduced by real time map-matching algorithms. For each journey, the algorithm globally searches for the closest path to the GPS positions, and so is inspired from the "path to path" algorithm's family. It uses the Multiple Hypothesis Technique (MHT) and relies on an innovative weighting system based on the area between the GPS points and the arcs making up the path. For high performance, the algorithm uses an iterative program and the data is stored in tree form.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Map-matching Algorithm for Large Databases



    Published in:

    Publication date :

    2015




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    53.84 Ortungstechnik, Radartechnik / 53.84 / 55.54 Flugführung / 42.89 / 55.20 / 55.44 / 55.86 / 55.54 / 55.86 Schiffsverkehr, Schifffahrt / 55.20 Straßenfahrzeugtechnik / 42.89 Zoologie: Sonstiges / 55.44 Schiffsführung
    Local classification TIB:    275/5680/7035



    An off-line map-matching algorithm for incomplete map databases

    Pereira, Francisco Câmara / Costa, Hugo / Pereira, Nuno Martinho | Springer Verlag | 2009

    Free access


    Context-dependent segmentation and matching in image databases

    Greenspan, H. / Dvir, G. / Rubner, Y. | British Library Online Contents | 2004


    Distribution of Large Navigable Databases

    Kelkar, S. / Intelligent Transportation Society of America | British Library Conference Proceedings | 1996


    Promoting safety using retrospective large databases

    Langwieder,K. / Baeumler,H. / Hummal,T. et al. | Automotive engineering | 1998