arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2606.23536cs.LG
收藏

基于稀疏计数数据的交通流无模拟估计

Simulation-Free Estimation of Traffic Flows from Sparse Count Data

Aix Marseille University, CNRS, LIS, Marseille, France(艾克斯-马赛大学,法国国家科学研究中心,计算机与系统实验室,马赛,法国);Université Libre de Bruxelles, Machine Learning Group, Brussels, Belgium(布鲁塞尔自由大学,机器学习组,布鲁塞尔,比利时);WEL Research Institute, Wavre, Belgium(WEL研究所,瓦夫尔,比利时)

Davide Guastella, Gianluca Bontempi

AI总结:

提出一种从稀疏聚合车辆计数中估计时变交通流模式的方法,通过分区、构建可行路径和加权最小二乘优化分配车辆,以低计算成本优于基线方法。

摘要:

我们提出了一种从稀疏聚合车辆计数中估计时变交通流模式的方法。该方法将研究区域划分为空间区域,构建一组可行的区域间路径,并求解加权最小二乘优化问题以确定每条路径上分配的车辆数量。加权贡献矩阵编码传感器覆盖范围,引导优化器朝向传感器可直接观测的流量配置。然后,通过根据聚合区域传感器计数的时间和体积分布对候选路线进行评分,推导出边缘级轨迹。该方法在布鲁塞尔道路网络上使用真实和合成交通数据进行了评估。结果表明,所提出的方法重现了输入数据中的日交通流量分布,并以极低的计算成本优于基线方法。

英文摘要:

We propose a method for estimating time-varying traffic flow patterns from sparse aggregated vehicle counts. The method partitions the study area into spatial regions, constructs a set of feasible region-to-region routes, and solves a weighted least-squares optimization problem to determine the number of vehicles to allocate on each route. A weighted contribution matrix encodes sensor coverage, steering the optimizer toward flow configurations that are directly observable by sensors. Edge-level trajectories are then derived by scoring candidate routes against the temporal and volumetric profiles of aggregated regional sensor counts. The method is evaluated on the Brussels road network using real and synthetic traffic data. Results show that the proposed approach reproduces the daily traffic profile in the input data and outperforms the baseline methods at a fraction of the computational cost.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑