arXiv:2503.15845cs.LG2025-03被引 7

用稀疏传感器数据精准估算全路网交通状态,提升跨城市泛化能力。

Network-wide Freeway Traffic Estimation Using Sparse Sensor Data: A Dirichlet Graph Auto-Encoder Approach

  • 基于狄利克雷能量的图传播机制,避免零值填充带来的偏差。
  • 区分拥堵与自由流模式,分别建模不同交通状态的传播规律。
  • 在极稀疏传感器条件下仍表现优异,适合实际部署场景。

网络级交通状态估计(TSE)旨在利用稀疏部署的传感器推断全路网交通状态,对智能交通系统至关重要。随着数据驱动方法的发展,交通动态建模已取得显著进展,但TSE对数据驱动方法仍具根本挑战:无传感器路段无法学习历史模式。尽管图表示学习在无传感器位置的状态估计中展现潜力,现有方法通常以零值填补缺失位置,导致图消息传播产生偏差。近期提出的狄利克雷能量特征传播(DEFP)方法在未观测节点分类上达到最先进水平,但应用于TSE面临三大挑战:无法处理有向交通网络、交通空间相关性建模假设过强、忽视不同交通模式(如拥堵与自由流)的差异传播规则。本文提出DGAE,一种新型归纳式图表示模型,通过理论推导的定向图狄利克雷能量传播(DEFP4D)、DEFP4D引导的潜在空间编码增强空间表征学习,以及物理启发的分模式传播机制,分别处理拥堵与自由流。在三个真实交通数据集上的实验表明,DGAE优于现有最先进方法,并展现出强跨城市迁移能力。此外,DEFP4D可独立作为轻量级方案,在传感器极度稀疏条件下表现更优。代码已公开于:https://github.com/ZJU-TSELab/DGAE。

原文摘要 · Abstract (English)

Network-wide Traffic State Estimation (TSE), which aims to infer a complete image of network traffic states with sparsely deployed sensors, plays a vital role in intelligent transportation systems. With the development of data-driven methods, traffic dynamics modeling has advanced significantly. However, TSE poses fundamental challenges for data-driven approaches, since historical patterns cannot be learned locally at sensor-free segments. Although graph representation learning shows promise in estimating states at locations without sensors, existing methods typically handle unobserved locations by filling them with zeros, introducing bias to the sensitive graph message propagation. The recently proposed Dirichlet Energy-based Feature Propagation (DEFP) method achieves State-Of-The-Art (SOTA) performance in unobserved node classification by eliminating the need for zero-filling. However, applying it to TSE faces three key challenges: inability to handle directed traffic networks, strong assumptions in traffic spatial correlation modeling, and overlooking distinct propagation rules of different patterns (e.g., congestion and free flow). We propose DGAE, a novel inductive graph representation model that addresses these challenges through theoretically derived DEFP for Directed graph (DEFP4D), enhanced spatial representation learning via DEFP4D-guided latent space encoding, and physics-guided propagation mechanisms that separately handle congested and free-flow patterns. Experiments on three traffic datasets demonstrate that DGAE outperforms existing SOTA methods and exhibits strong cross-city transferability. Furthermore, DEFP4D can serve as a standalone lightweight solution, showing superior performance under extremely sparse sensor conditions. The code of this work is publicly available at: https://github.com/ZJU-TSELab/DGAE.

交通估计图神经网络稀疏数据城市交通

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。