Lane-Level Travel Time Estimation and Space-Time Routing for Connected Vehicles with Real-Time Data at Intersections

The rapid expansion and advancement of roadside detectors has led to an abundance of traffic data, which can be directly forwarded to vehicles through V2X communication. The comprehensive dynamic real-time data brings opportunities for more precise applications to improve the traffic. Based on the real-time signal timing and queue length data before the stop bar, this study presents a method for estimating lane-level travel time varying in seconds. In addition, an algorithm for routing has been developed to compute a space–time path with the minimum travel time. To address uncertainty and randomness, the routing algorithm is embedded into a rolling horizon framework. The routing algorithm has been tested and validated using the SUMO (Simulation of Urban Mobility) simulation. The results show that, in comparison with the spatial shortest path obtained by the Dijkstra algorithm as the baseline, the proposed algorithm achieves an average reduction of 11.84% in total travel time.

Authors

Institutions

Publication Details

Published
2024-12-11
DOI
https://doi.org/10.1061/9780784485484.170
Primary Topic
Traffic Prediction and Management Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Lane-Level Travel Time Estimation and Space-Time Routing for Connected Vehicles with Real-Time Data at Intersections

Xingyi He, Qing-Quan Liu, Huimin Yan, Meng Li et al.
Traffic Prediction and Management Techniques
article

Lane-Level Travel Time Estimation and Space-Time Routing for Connected Vehicles with Real-Time Data at Intersections

Xingyi He, Qing-Quan Liu, Huimin Yan, Meng Li, Shen Li
article en

Abstract

The rapid expansion and advancement of roadside detectors has led to an abundance of traffic data, which can be directly forwarded to vehicles through V2X communication. The comprehensive dynamic real-time data brings opportunities for more precise applications to improve the traffic. Based on the real-time signal timing and queue length data before the stop bar, this study presents a method for estimating lane-level travel time varying in seconds. In addition, an algorithm for routing has been developed to compute a space–time path with the minimum travel time. To address uncertainty and randomness, the routing algorithm is embedded into a rolling horizon framework. The routing algorithm has been tested and validated using the SUMO (Simulation of Urban Mobility) simulation. The results show that, in comparison with the spatial shortest path obtained by the Dijkstra algorithm as the baseline, the proposed algorithm achieves an average reduction of 11.84% in total travel time.

Alibaba Group (United States) (US), Tsinghua University (CN)
Sustainable cities and communities
Openalex Percentile: Top 76%
Traffic Prediction and Management Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.