Dual-Channel Dynamic Gated Spatio-Temporal Graph for Traffic Flow Forecasting

IF 3.4 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Chao Wang;Jun-Feng Hao;He Huang;Wang Zou;Xia Sun;Ting Peng
{"title":"Dual-Channel Dynamic Gated Spatio-Temporal Graph for Traffic Flow Forecasting","authors":"Chao Wang;Jun-Feng Hao;He Huang;Wang Zou;Xia Sun;Ting Peng","doi":"10.1109/ACCESS.2025.3553535","DOIUrl":null,"url":null,"abstract":"Traffic flow forecasting is a critical and essential technology in the field of Intelligent Transportation Systems (ITS), as it plays a pivotal role in optimizing traffic management, improving road safety, and enhancing the overall efficiency of transportation networks. However, current research neglects the relationships between the local and global traffic flow data. Additionally, the predefined static graph structure fails to adequately capture the dynamic spatial features of traffic flow. To address the these challenges, this paper proposes a Dual-Channel Dynamic Gated Spatio-Temporal graph network (DC-DGST) for traffic flow prediction. We consider hourly slices as the local feature and daily slices to be the global feature of traffic flow. The DC-DGST framework employs a dual-channel structure to capture spatiotemporal dependencies between global and local features. It transforms the predefined static graph into a dynamic graph, enabling the establishment of connections between input data and historical information. Furthermore, we design gated spatio-temporal blocks based on residual structures within the spatio-temporal module. Specifically, we utilize Graph Gated Neural Networks (GGNNs) to learn and integrate both static and dynamic graphs, while Transformer encoders are used to capture long-range dependencies in the temporal sequence. We conducted a series of experiments on four publicly available benchmark datasets: PEMS03, PEMS04, PEMS07, and PEMS08. The results demonstrate that our model significantly outperforms baseline models. Moreover, the dual-channel structure effectively captures the correlation between local and global traffic flow features, while the dynamic graph enhances the model’s overall performance.","PeriodicalId":13079,"journal":{"name":"IEEE Access","volume":"13 ","pages":"52995-53006"},"PeriodicalIF":3.4000,"publicationDate":"2025-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10937097","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Access","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10937097/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Traffic flow forecasting is a critical and essential technology in the field of Intelligent Transportation Systems (ITS), as it plays a pivotal role in optimizing traffic management, improving road safety, and enhancing the overall efficiency of transportation networks. However, current research neglects the relationships between the local and global traffic flow data. Additionally, the predefined static graph structure fails to adequately capture the dynamic spatial features of traffic flow. To address the these challenges, this paper proposes a Dual-Channel Dynamic Gated Spatio-Temporal graph network (DC-DGST) for traffic flow prediction. We consider hourly slices as the local feature and daily slices to be the global feature of traffic flow. The DC-DGST framework employs a dual-channel structure to capture spatiotemporal dependencies between global and local features. It transforms the predefined static graph into a dynamic graph, enabling the establishment of connections between input data and historical information. Furthermore, we design gated spatio-temporal blocks based on residual structures within the spatio-temporal module. Specifically, we utilize Graph Gated Neural Networks (GGNNs) to learn and integrate both static and dynamic graphs, while Transformer encoders are used to capture long-range dependencies in the temporal sequence. We conducted a series of experiments on four publicly available benchmark datasets: PEMS03, PEMS04, PEMS07, and PEMS08. The results demonstrate that our model significantly outperforms baseline models. Moreover, the dual-channel structure effectively captures the correlation between local and global traffic flow features, while the dynamic graph enhances the model’s overall performance.
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Access
IEEE Access COMPUTER SCIENCE, INFORMATION SYSTEMSENGIN-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
9.80
自引率
7.70%
发文量
6673
审稿时长
6 weeks
期刊介绍: IEEE Access® is a multidisciplinary, open access (OA), applications-oriented, all-electronic archival journal that continuously presents the results of original research or development across all of IEEE''s fields of interest. IEEE Access will publish articles that are of high interest to readers, original, technically correct, and clearly presented. Supported by author publication charges (APC), its hallmarks are a rapid peer review and publication process with open access to all readers. Unlike IEEE''s traditional Transactions or Journals, reviews are "binary", in that reviewers will either Accept or Reject an article in the form it is submitted in order to achieve rapid turnaround. Especially encouraged are submissions on: Multidisciplinary topics, or applications-oriented articles and negative results that do not fit within the scope of IEEE''s traditional journals. Practical articles discussing new experiments or measurement techniques, interesting solutions to engineering. Development of new or improved fabrication or manufacturing techniques. Reviews or survey articles of new or evolving fields oriented to assist others in understanding the new area.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信