Predicting the travel time of a path is an important task in route planning and navigation applications. As more GPS oating car data has been collected to monitor urban tra c, GPS trajectories of oating cars have been frequently used to predict path travel time. However, most trajectory-based methods rely on deploying GPS devices and collect real-time data on a large taxi eet, which can be expensive and unreliable in smaller cities. is work deals with the problem of predicting path travel time when only a small number of GPS oating cars are available. We developed an algorithm that learns local congestion pa erns of a compact set of frequently shared paths from historical data. Given a travel time prediction query, we identify the current congestion pa erns around the query path from recent trajectories, then infer its travel time in the near future. Experimental results using 10-15 taxis tracked for 11 months in urban areas of Shenzhen, China show that our prediction has on average 5.4 minutes of error on trips of duration 10-75 minutes. is result improves the baseline approach of using purely historical trajectories by 2-30% on regions with various degree of path regularity. It also outperforms a state-of-the-art travel time prediction method that uses both historical trajectories and real-time trajectories.
Li et al. REF demonstrate promise in predicting travel times using only a small number of GPS cars.
Urban Travel Time Prediction using a Small Number of GPS Floating Cars
SIGSPATIAL'17
Computer Science