Short-Term Urban Link Travel Time Prediction Using Dynamic Time Warping With Disaggregate Probe Data
Ruotian Tang, Ryo Kanamori, Toshiyuki Yamamoto
IEEE Access · 2019
doi:10.1109/access.2019.2929791 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
There is increasing demand for short-term urban link travel time prediction to build an advanced intelligent transportation system (ITS). With the development of data collection technology, probe data are receiving more attention but the penetration rate of probe vehicles capable of sending probe data is still limited. Most research pertaining to short-term travel time prediction tends to aggregate probe data to obtain useful samples when the penetration rate is low. However, as a result, the prediction can only provide a general description of the travel time and changes in travel time during a short time interval are neglected. To overcome this limitation, a non-parametric model using disaggregate probe data based on dynamic time warping (DTW) was developed in this study. Data from the crossing direction are introduced to separate the data into different signal phases instead of identifying the exact signal pattern. A classical k-nearest neighbor (KNN) model and a naïve model were compared with the proposed model. The models were tested in three scenarios: a computer simulation and two real cases from Nagoya, Japan. The results showed that the proposed model outperforms the other two models under different data penetration rates because it can reflect changes in travel time during a traffic signal cycle. Moreover, the proposed model has wider applicability than the KNN model because it is free from the equal time interval constraint.
Abstract licence: CC BY-NC-ND
References45
40 more references, whose wording the paper’s licence keeps private.
All 45 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.