跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20067 · v1

World-Model-Guided Plan Search for Cooperative Mixed-Traffic Control at Bottlenecks

首次提交 2026-11-15 23:18
版本更新 2026-11-15 23:18
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

Cooperative speed control by connected and automated vehicles can reduce congestion at lane drop bottlenecks. However, effective coordination depends on vehicle roles and execution timing, while initial holding costs may be offset by later traffic benefits. This paper proposes an offline plan search framework that combines world model guidance with simulator verification. A traffic world model incorporating physical dynamics guides evolutionary search over vehicle roles, target speeds, holding durations, and start times. Paired SUMO simulations screen candidates for total delay reduction and limits on additional mean delay across vehicle groups. Accepted plans form a reusable library whose actions temporarily override a frozen MAPPO policy. Across 192 paired test scenarios at 60% penetration and a demand of 2,800 vehicles per hour, the searched library reduces mean total delay by 14.3% relative to MAPPO and by 3.8% relative to a handwritten plan library. The largest increase in group mean delay is 6.2 s, below the prescribed 10 s limit. In a separate screening experiment, the guided search achieves a 30.0% pass rate compared with 2.6% for random sampling. These results support the use of predictive search and independent verification for discovering cooperative plans under group delay constraints.

作者备注:8 pages

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-15 23:18 · 最新观测版本

World-Model-Guided Plan Search for Cooperative Mixed-Traffic Control at Bottlenecks

Cooperative speed control by connected and automated vehicles can reduce congestion at lane drop bottlenecks. However, effective coordination depends on vehicle roles and execution timing, while initial holding costs may be offset by later traffic benefits. This paper proposes an offline plan search framework that combines world model guidance with simulator verification. A traffic world model incorporating physical dynamics guides evolutionary search over vehicle roles, target speeds, holding durations, and start times. Paired SUMO simulations screen candidates for total delay reduction and limits on additional mean delay across vehicle groups. Accepted plans form a reusable library whose actions temporarily override a frozen MAPPO policy. Across 192 paired test scenarios at 60% penetration and a demand of 2,800 vehicles per hour, the searched library reduces mean total delay by 14.3% relative to MAPPO and by 3.8% relative to a handwritten plan library. The largest increase in group mean delay is 6.2 s, below the prescribed 10 s limit. In a separate screening experiment, the guided search achieves a 30.0% pass rate compared with 2.6% for random sampling. These results support the use of predictive search and independent verification for discovering cooperative plans under group delay constraints.

查看此版本解读 →查看此版本原文 ↗