Dynamic Variable Emergency Path Planning Method Based on Spatio-Temporal Correlation Analysis of Vertices in Graph

In recent years, with the continuous rise of the number of vehicles in cities, the degree of road network congestion has become increasingly serious. For this purpose, this paper will focus on the congestion change law at the intersections of the road network. At the same time, three novel graph correlation analysis models are proposed to reduce the congestion of urban road networks. Compared with the traditional road network model, our proposed method will establish a rank-based graph correlation model and two vertex factor transfer models based on maximum probability path for each intersection in the road network through the congestion coefficient transfer strategy based on intersections. Combining three kinds of graph vertex models, a dynamic variable emergency path planning method with heuristic function is designed. Finally, the proposed model and method are verified by the travel time experiments of vehicles under different distances and distribution of vehicles in the road network. Three graph correlation analysis models were obtained by the congestion coefficient parameter results to reduce the impact of congestion coefficient in the global search and local search, respectively.

Authors

Institutions

Publication Details

Journal
Transportation Research Record Journal of the Transportation Research Board
Published
2025-11-01
DOI
https://doi.org/10.1177/03611981251348443
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

Dynamic Variable Emergency Path Planning Method Based on Spatio-Temporal Correlation Analysis of Vertices in Graph

Bin Ma, Bowen Yang, Mingyang Li, Zhi Cai et al.
Transportation Research Record Journal of the Transportation Research Board
Traffic Prediction and Management Techniques
article

Dynamic Variable Emergency Path Planning Method Based on Spatio-Temporal Correlation Analysis of Vertices in Graph

Bin Ma, Bowen Yang, Mingyang Li, Zhi Cai, K. S. Zhu
article en

Abstract

In recent years, with the continuous rise of the number of vehicles in cities, the degree of road network congestion has become increasingly serious. For this purpose, this paper will focus on the congestion change law at the intersections of the road network. At the same time, three novel graph correlation analysis models are proposed to reduce the congestion of urban road networks. Compared with the traditional road network model, our proposed method will establish a rank-based graph correlation model and two vertex factor transfer models based on maximum probability path for each intersection in the road network through the congestion coefficient transfer strategy based on intersections. Combining three kinds of graph vertex models, a dynamic variable emergency path planning method with heuristic function is designed. Finally, the proposed model and method are verified by the travel time experiments of vehicles under different distances and distribution of vehicles in the road network. Three graph correlation analysis models were obtained by the congestion coefficient parameter results to reduce the impact of congestion coefficient in the global search and local search, respectively.

Transportation Research Record Journal of the Transportation Research BoardVol. 2679(11)
North China University of Water Resources and Electric Power (CN), Beijing University of Technology (CN)
Openalex Percentile: Top 62%
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.