Metraipolis › archive › dc_0f834ce03067
Robust Multi-Agent Pursuit with Preemptive Communication via Reachability-Based Control Barrier Functions — arXiv:2610.22198
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.22198
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T08:44:02.838Z
- SHA-256 of the archived text
892778853dd6c1b2362c3eb9360f2d4ec4c40dcf0e8312fb9eb3eb993bf8d188- Stable URL of this page
https://metraipolis.com/documento/dc_0f834ce03067
How to cite
Robust Multi-Agent Pursuit with Preemptive Communication via Reachability-Based Control Barrier Functions — arXiv:2610.22198 — arXiv (en), https://arxiv.org/abs/2610.22198 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0f834ce03067 (Metraipolis archive dc_0f834ce03067, sha256 892778853dd6c1b2362c3eb9360f2d4ec4c40dcf0e8312fb9eb3eb993bf8d188)
BibTeX
@misc{dc0f834ce03067,
title = {Robust Multi-Agent Pursuit with Preemptive Communication via Reachability-Based Control Barrier Functions — arXiv:2610.22198},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.22198},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0f834ce03067; sha256 892778853dd6c1b2362c3eb9360f2d4ec4c40dcf0e8312fb9eb3eb993bf8d188},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22198. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Safe multi-agent coordination typically assumes what real-world, deployed, resource-constrained robots cannot provide: continuous, perfect state sharing. Robust control strategies must be complemented with robust communication strategies to deliver resilient deployments. In this work, we propose a unified control/communication strategy that provides safe control to guarantee inter-agent safety under intermittent communication and demonstrate its effectiveness in a pursuit-evasion scenario. Each agent computes the reachable set of neighboring agents based on the last state information received, then solves for a safe control input based on control barrier functions to ensure agents avoid collision. We prove that inter-agent collision avoidance is guaranteed provided communication staleness remains bounded. As the reachable set inflates between state transmissions, each agent reasons about when to preemptively transmit its state information to neighboring agents based on novel metrics characterizing uncertainty risk and kinematic risk. We implement and simulate a variety of pursuit-evasion scenarios and show that preemptive communication reduces messages by 77.5% compared to periodic and event-triggered baselines with zero collisions. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.MA, nuovi lavori del giorno). Categorie arXiv: Systems and Control (eess.SY) ; Multiagent Systems (cs.MA); Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2610.22198 — 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-10-16T08:43:47.674Z dalla pagina https://arxiv.org/list/cs.MA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).