4.4 Article

Dynamic Origin-Destination Matrix Prediction with Line Graph Neural Networks and Kalman Filter

期刊

TRANSPORTATION RESEARCH RECORD
卷 2674, 期 8, 页码 491-503

出版社

SAGE PUBLICATIONS INC
DOI: 10.1177/0361198120919399

关键词

-

资金

  1. NYU Tandon School of Engineering

向作者/读者索取更多资源

Modern intelligent transportation systems provide data that allow real-time dynamic demand prediction, which is essential for planning and operations. The main challenge of prediction of dynamic origin-destination (O-D) demand matrices is that demand cannot be directly measured by traffic sensors; instead, it has to be inferred from aggregate traffic flow data on traffic links. Specifically, spatial correlation, congestion and time dependent factors need to be considered in general transportation networks. This paper proposes a novel O-D prediction framework combining heterogeneous prediction in graph neural networks and Kalman filter to recognize spatial and temporal patterns simultaneously. The underlying road network topology is converted into a corresponding line graph in the newly designed fusion line graph convolutional networks (FL-GCNs), which provide a general framework of predicting spatial-temporal O-D flows from link information. Data from the New Jersey Turnpike network are used to evaluate the proposed model. The results show that the proposed approach yields the best performance under various prediction scenarios. In addition, the advantage of combining deep neural networks and Kalman filter is demonstrated.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据