Metraipolis › archive › dc_f796cb2de913

Exact Feasibility Certification and Optimal Responsibility Allocation for Multi-Robot CBF Safety Filters — arXiv:2609.14935

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14935
License (as archived)
CC0-1.0
Archived
2026-10-15T22:41:34.611Z
SHA-256 of the archived text
238e47f2e2e3b3a3aa2248a688636993bcb130daafe4931958bf100c8cd11385
Stable URL of this page
https://metraipolis.com/documento/dc_f796cb2de913

How to cite

Exact Feasibility Certification and Optimal Responsibility Allocation for Multi-Robot CBF Safety Filters — arXiv:2609.14935 — arXiv (en), https://arxiv.org/abs/2609.14935 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f796cb2de913 (Metraipolis archive dc_f796cb2de913, sha256 238e47f2e2e3b3a3aa2248a688636993bcb130daafe4931958bf100c8cd11385)
BibTeX
@misc{dcf796cb2de913,
  title = {Exact Feasibility Certification and Optimal Responsibility Allocation for Multi-Robot CBF Safety Filters — arXiv:2609.14935},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14935},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f796cb2de913; sha256 238e47f2e2e3b3a3aa2248a688636993bcb130daafe4931958bf100c8cd11385},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14935. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Multi-robot Control Barrier Function (CBF) safety filters can become infeasible, but a failed quadratic program (QP) does not indicate why the conflict occurred or how to resolve it. To address this, we develop an exact feasibility certificate for multi-agent CBF filters with heterogeneous control-affine dynamics and convex input sets. The certificate quantifies a feasibility reserve by separating the demand imposed by safety constraints from the available actuator supply. This decomposition shows when CBF gain tuning or increased actuation can and cannot resolve infeasibility, and identifies the agents and interactions responsible for the conflict. We further propose an algorithm to optimally allocate shared safety constraints by maximizing the worst local feasibility margin, yielding a linear program for polyhedral input sets. In $320$ paired closed-loop simulations, the proposed allocation reduces infeasible control steps from roughly $50\%$ to $6.2\%$, and reduces safety-violating runs from $118/160$ to $24/160$. In addition, across $52$ infeasibility events, the certificate identifies an interaction whose relaxation restores feasibility in $94\%$ of cases.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-15 in cs.MA).
Categorie arXiv: Robotics (cs.RO) ; Multiagent Systems (cs.MA).
Pagina del lavoro: https://arxiv.org/abs/2609.14935 — 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-15T22:21:04.241Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).