Metraipolis › archive › dc_756fcaaba7c0
Safeguarding Multi-Agent Reinforcement Learning for Connected and Automated Vehicles with Recursively Feasible Control Barrier Functions — arXiv:2611.04957
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04957
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T19:05:16.958Z
- SHA-256 of the archived text
30f8873e3f585410257e510db67057c6b55686bf44a31a9ae1450cfb449ec936- Stable URL of this page
https://metraipolis.com/documento/dc_756fcaaba7c0
How to cite
Safeguarding Multi-Agent Reinforcement Learning for Connected and Automated Vehicles with Recursively Feasible Control Barrier Functions — arXiv:2611.04957 — arXiv (en), https://arxiv.org/abs/2611.04957 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_756fcaaba7c0 (Metraipolis archive dc_756fcaaba7c0, sha256 30f8873e3f585410257e510db67057c6b55686bf44a31a9ae1450cfb449ec936)
BibTeX
@misc{dc756fcaaba7c0,
title = {Safeguarding Multi-Agent Reinforcement Learning for Connected and Automated Vehicles with Recursively Feasible Control Barrier Functions — arXiv:2611.04957},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04957},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_756fcaaba7c0; sha256 30f8873e3f585410257e510db67057c6b55686bf44a31a9ae1450cfb449ec936},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04957. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Multi-Agent Reinforcement Learning (MARL) shows promise in coordinating connected and automated vehicles but offers no safety guarantee. Although Control Barrier Functions (CBFs) can add this guarantee, their optimization problem can become infeasible in practice due to control bounds. Moreover, they often overapproximate vehicle and road geometry, which makes them conservative. This paper proposes the Backup-Horizon CBF (BH-CBF), which evaluates safety along a horizon until all vehicles stop. BH-CBF is recursively feasible under control bounds, and it considers the exact vehicle and road geometry. Based on BH-CBF, we derive a fully decentralized safety filter that only needs a single broadcast of vehicle states and routes per step and stays real-time in dense traffic. We use BH-CBF to safeguard a MARL policy over its life cycle: as a reward during pre-training, as a run-time filter at deployment, and as a filter in the training loop that keeps fine-tuning on unseen maps collision-free. In simulations on real-world maps of a roundabout and an intersection, BH-CBF avoids all collisions of unsafe MARL policies and keeps its safety guarantee at every step. Existing filters either collide, lose the guarantee, or fall back to full braking far more often. In recorded roundabout traffic with 1264 human-driven vehicles over 115 km, our safeguarded policies shorten the median travel time by 14% compared with the human drivers, without any collision. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.RO, nuovi lavori del giorno). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2611.04957 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-04T18:39:52.416Z dalla pagina https://arxiv.org/list/cs.RO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).