Path inference from sparse floating car data for urban networks

被引:103
作者
Rahmani, Mahmood [1 ]
Koutsopoulos, Hans N. [1 ]
机构
[1] KTH Royal Inst Technol, Dept Transport Sci, SE-10044 Stockholm, Sweden
关键词
Map-matching; Path inference; Sparse floating car data; GPS;
D O I
10.1016/j.trc.2013.02.002
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
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. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:41 / 54
页数:14
相关论文
共 26 条
[1]  
[Anonymous], P ITS WORLD C 2002 C
[2]  
Bernstein D., 1996, An introduction to map matching for personal navigation assistants
[3]  
Brakatsoulas S., 2005, Proceedings of the 31st VLDB Conference, P864
[4]  
Demir C., 2003, 10 WORLD C EXH INT T
[5]  
Dijkstra E. W., 1959, Numerische Mathematik, V1, P269, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]
[6]   A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS [J].
HART, PE ;
NILSSON, NJ ;
RAPHAEL, B .
IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02) :100-+
[7]  
Huber W., 1999, P 6 WORLD C INT TRAN
[8]  
Hunter T., 2012, IEEE T INTELLI UNPUB
[9]  
Hunter T., 2009, P NEUR INF PROC SYST
[10]  
Jenelius E., 2012, TRAVEL TIME ESTIMATI