Dynamic spatial-temporal graph convolutional recurrent networks for traffic flow forecasting

被引:22
作者
Xia, Zhichao [1 ]
Zhang, Yong [2 ]
Yang, Jielong [1 ]
Xie, Linbo [1 ]
机构
[1] Jiangnan Univ, Sch Internet Things Engn, Wuxi, Jiangsu, Peoples R China
[2] Wuhan Univ Sci & Technol, Sch Informat Sci & Engn, Wuhan, Hubei, Peoples R China
基金
中国国家自然科学基金;
关键词
Traffic flow forecasting; Dynamic graph generator; Graph convolutional networks; Graph recurrent networks; Spatial-temporal dependencies; DEEP BELIEF NETWORKS; ATTENTION NETWORKS; PREDICTION;
D O I
10.1016/j.eswa.2023.122381
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Traffic flow forecasting is crucial for making appropriate route guidance and vehicle scheduling schemes in intelligent transportation systems. However, recent graph-based methods leverage pre-defined static graphs to describe the spatial-temporal characteristic of road networks. The interactions of two road segments are changeable under the influence of natural environmental and socioeconomic factors, while these methods are not sufficient to capture the complicated dynamic correlations of different nodes. To address these problems, we propose a novel dynamic graph-based deep learning framework with dynamic graph recurrent network for traffic flow forecasting, called Dynamic Spatial-temporal Graph Recurrent Neural Networks. In this framework, a novel dynamic graph generator is designed to obtain the dynamic representation of nodes, which employs multi-head attention network and dynamic node embedding to capture hidden spatial dependency more effectively. To infer the edge status of dynamic graph at different times, the generated dynamic graph is trained as special time series data via dynamic graph recurrent neural network for downstream time-series prediction. In contrast to methods straightforwardly concatenating static graphs and dynamic graphs, a novel fusion framework integrates two-channel convolutional networks with penalty terms and a gate fusion layer to extract dynamic spatial dependency from multiple graphs for improving forecasting accuracy and reducing computational consumption. Experiments on three real-world datasets are carried out to evaluate the superior performance of our model. Compared with previous state-of-the-art baselines, the proposed method performs much better with 10%-26% improvements on three datasets. The results also indicate that our model is robust against emergent traffic situations.
引用
收藏
页数:15
相关论文
共 54 条
[1]   Unidirectional and Bidirectional LSTM Models for Short-Term Traffic Prediction [J].
Abduljabbar, Rusul L. ;
Dia, Hussein ;
Tsai, Pei-Wei .
JOURNAL OF ADVANCED TRANSPORTATION, 2021, 2021
[2]  
Atwood J, 2016, ADV NEUR IN, V29
[3]  
Bai L, 2020, ADV NEUR IN, V33
[4]  
Barros J, 2015, 2015 INTERNATIONAL CONFERENCE ON MODELS AND TECHNOLOGIES FOR INTELLIGENT TRANSPORTATION SYSTEMS (MT-ITS), P132, DOI 10.1109/MTITS.2015.7223248
[5]  
Ben-Akiva M., 1998, DACCORS SHORT TERM F
[6]   A Hybrid Prediction Method for Realistic Network Traffic With Temporal Convolutional Network and LSTM [J].
Bi, Jing ;
Zhang, Xiang ;
Yuan, Haitao ;
Zhang, Jia ;
Zhou, MengChu .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2022, 19 (03) :1869-1879
[7]  
Cascetta E., 2013, Transportation systems engineering: theory and methods, V49
[8]   Prediction of gas concentration evolution with evolutionary attention-based temporal graph convolutional network [J].
Cheng, Lei ;
Li, Li ;
Li, Sai ;
Ran, Shaolin ;
Zhang, Ze ;
Zhang, Yong .
EXPERT SYSTEMS WITH APPLICATIONS, 2022, 200
[9]  
Defferrard M, 2016, ADV NEUR IN, V29
[10]   Spatial-Temporal Graph ODE Networks for Traffic Flow Forecasting [J].
Fang, Zheng ;
Long, Qingqing ;
Song, Guojie ;
Xie, Kunqing .
KDD '21: PROCEEDINGS OF THE 27TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2021, :364-373