Highlights ► A map-matching and path inference algorithm for sparse GPS probes is introduced. ► It assumes limited information (only coordinates and timestamp) is available. ► Global criteria are used to identify the path corresponding to observed probes. ► The method demonstrates superior performance compared to similar algorithms. ► It performs efficiently in both off-line and on-line applications.

    Abstract The use of probe vehicles in traffic management is growing rapidly. The reason is that the required data collection infrastructure is increasingly in place in urban areas with a significant number of mobile sensors constantly moving and covering expansive areas of the road network. In many cases, the data is sparse in time and location and includes only geo-location and timestamp. Extracting paths taken by the vehicles from such sparse data is an important step towards travel time estimation and is referred to as the map-matching and path inference problem. This paper introduces a path inference method for low-frequency floating car data, assesses its performance, and compares it to recent methods using a set of ground truth data.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Path inference from sparse floating car data for urban networks


    Contributors:


    Publication date :

    2013-02-04


    Size :

    14 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Travel time estimation from sparse floating car data with consistent path inference: A fixed point approach

    Rahmani, Mahmood / Koutsopoulos, Haris N. / Jenelius, Erik | Elsevier | 2017


    Path inference of low-frequency GPS probes for urban networks

    Rahmani, Mahmood / Koutsopoulos, Haris N. | IEEE | 2012