Path inference from sparse floating car data for urban networks
► 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...
Saved in:
Published in | Transportation research. Part C, Emerging technologies Vol. 30; pp. 41 - 54 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Kidlington
Elsevier India Pvt Ltd
01.05.2013
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | ► 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.
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. |
---|---|
ISSN: | 0968-090X 1879-2359 1879-2359 |
DOI: | 10.1016/j.trc.2013.02.002 |