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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Map-matching Algorithm for Large Databases



    Erschienen in:

    Erscheinungsdatum :

    2015




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch



    Klassifikation :

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




    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. | Kraftfahrwesen | 1998


    Clustering Time-Series Medical Databases Based on the Improved Multiscale Matching

    Hirano, S. / Tsumoto, S. | British Library Conference Proceedings | 2005