Metraipolis › archive › dc_94cb4fb87ede

Exact Signed-Distance Control Barrier Functions via Minkowski Operations for Safe Navigation among Polytopes — arXiv:2608.02886

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.02886
License (as archived)
CC0-1.0
Archived
2026-10-31T13:07:47.936Z
SHA-256 of the archived text
02c1af8e8f6b700a3c3568a13268d6983759d73c2593d8ea7186f1baf83ec4d8
Stable URL of this page
https://metraipolis.com/documento/dc_94cb4fb87ede

How to cite

Exact Signed-Distance Control Barrier Functions via Minkowski Operations for Safe Navigation among Polytopes — arXiv:2608.02886 — arXiv (en), https://arxiv.org/abs/2608.02886 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_94cb4fb87ede (Metraipolis archive dc_94cb4fb87ede, sha256 02c1af8e8f6b700a3c3568a13268d6983759d73c2593d8ea7186f1baf83ec4d8)
BibTeX
@misc{dc94cb4fb87ede,
  title = {Exact Signed-Distance Control Barrier Functions via Minkowski Operations for Safe Navigation among Polytopes — arXiv:2608.02886},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.02886},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_94cb4fb87ede; sha256 02c1af8e8f6b700a3c3568a13268d6983759d73c2593d8ea7186f1baf83ec4d8},
  year = {2026}
}

Archived text

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

Safely navigating polytopic environments while respecting the dynamics, control, and exact geometry of the underlying system is a challenge in robotics. Control barrier functions (CBFs) synthesize safe control policies by rendering the safe set forward invariant, but many existing CBF-based methods approximate polytopes using conservative smooth shapes, such as spheres or ellipsoids, to obtain explicit differentiable distance functions. In this article, we propose an exact Signed Distance Function (SDF) formulation for a {\it polytopic} robot and {\it polytopic} obstacles and integrate it with nonsmooth CBFs. Leveraging Minkowski operations, the proposed method computes the exact SDF via companion convex programs in both the collision-free (positive-sign) and in-collision (negative-sign) cases. Furthermore, by exploiting the convenient geometric properties of 2D Minkowski operations and the optimality conditions of the two companion convex programs, we derive a unified analytical expression for the gradient of the exact SDF via sensitivity analysis. The exact rotational gradient further reveals a previously masked class of local minima induced by the coupling between geometry and nonholonomic kinematics. We demonstrate the effectiveness of the proposed framework through a pure-translation case and three scenarios with unicycle models involving recovery from an unsafe initialization and single- and multiple-obstacle avoidance. Comparisons with baseline methods highlight how the proposed framework enables non-conservative maneuvers and safety recovery.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-05 in cs.RO).
Categorie arXiv: Robotics (cs.RO) ; Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2608.02886 — 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-31T12:55:56.543Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).