Metraipolis › archive › dc_36cd573ff1b3

Adversarially Robust Geometric Safety Certificates for Nonholonomic Robots Against Maneuvering Obstacles — arXiv:2609.37126

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.37126
License (as archived)
CC0-1.0
Archived
2026-10-07T16:21:27.954Z
SHA-256 of the archived text
8e9b6dccffc29dc050e006587006679018989851c3b1b81554151ee70f6658a9
Stable URL of this page
https://metraipolis.com/documento/dc_36cd573ff1b3

How to cite

Adversarially Robust Geometric Safety Certificates for Nonholonomic Robots Against Maneuvering Obstacles — arXiv:2609.37126 — arXiv (en), https://arxiv.org/abs/2609.37126 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_36cd573ff1b3 (Metraipolis archive dc_36cd573ff1b3, sha256 8e9b6dccffc29dc050e006587006679018989851c3b1b81554151ee70f6658a9)
BibTeX
@misc{dc36cd573ff1b3,
  title = {Adversarially Robust Geometric Safety Certificates for Nonholonomic Robots Against Maneuvering Obstacles — arXiv:2609.37126},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.37126},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_36cd573ff1b3; sha256 8e9b6dccffc29dc050e006587006679018989851c3b1b81554151ee70f6658a9},
  year = {2026}
}

Archived text

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

Safe navigation against obstacles that can actively maneuver within bounded capabilities remains challenging: robust control barrier function methods typically treat obstacle actions as generic disturbances, while differential-game approaches are computationally expensive for online navigation. We propose an adversarially robust geometric certificate that accounts for the worst-case effect of admissible obstacle maneuvers directly in the safe-set geometry through a closed-form contraction of the certificate parameters. The construction exploits a structural property of line-of-sight (LoS) certificates: the robot and obstacle actions enter the certificate through a common state-dependent geometric gain. This gain cancels in the worst-case comparison, reducing the differential game to a direct comparison between obstacle maneuvering capability and the weaker of the robot's longitudinal and steering authorities. Instantiated on the parabolic certificate, the construction yields Adversarially Robust Dynamic Parabolic Control Barrier Functions (AR-DPCBF), for which we establish sufficient conditions for forward invariance of the contracted safe set against all admissible obstacle maneuvers under kinematic bicycle dynamics with bounded inputs. When the obstacle capability is unknown, a sliding-window estimator supplies a high-probability upper bound, allowing the guarantee to be retained with the corresponding coverage probability. We further formulate soft and buffered variants to recover feasibility in dense environments. Simulations across obstacle capabilities, densities, and capability mismatch show substantial reductions in barrier violations and collisions and demonstrate that pointwise robustification of the barrier derivative cannot substitute for contraction of its geometry.

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