跳到主要内容
AI News HubLIVE
来源内容 · 翻译待补全2 分钟阅读

待翻译:Control Barrier Functions via Minkowski Operations for Safe Navigation among Polytopes

文章摘要

AI 服务暂时不可用,以下为来源摘要,待恢复后补全翻译:arXiv:2608.02886v1 Announce Type: new Abstract: 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…

来源arXiv Robotics作者: Yi-Hsuan Chen, Shuo Liu, Wei Xiao, Calin Belta, Michael Otte
待翻译:Control Barrier Functions via Minkowski Operations for Safe Navigation among Polytopes
报告错误

纠错通道尚未开通,可先复制下方文章信息留存。

查看更正说明
直接读正文

AI 服务暂时不可用,以下为来源正文,待恢复后补全翻译。

--> [Submitted on 3 Aug 2026] Title:Control Barrier Functions via Minkowski Operations for Safe Navigation among Polytopes View a PDF of the paper titled Control Barrier Functions via Minkowski Operations for Safe Navigation among Polytopes, by Yi-Hsuan Chen and 4 other authors View PDF HTML (experimental) Abstract: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. Comments: 16 pages, 13 figures. Expanded version of a paper published in IEEE CDC 2025. Demo video: this https URL Subjects: Robotics (cs.RO); Systems and Control (eess.SY) Cite as: arXiv:2608.02886 [cs.RO] (or arXiv:2608.02886v1 [cs.RO] for this version) https://doi.org/10.48550/arXiv.2608.02886 arXiv-issued DOI via DataCite (pending registration) Submission history From: Yi-Hsuan Chen [view email] [v1] Mon, 3 Aug 2026 21:15:23 UTC (2,800 KB) Full-text links: Access Paper: View a PDF of the paper titled Control Barrier Functions via Minkowski Operations for Safe Navigation among Polytopes, by Yi-Hsuan Chen and 4 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.RO new | recent | 2026-08 Change to browse by: cs cs.SY eess eess.SY References & Citations NASA ADS Google Scholar Semantic Scholar Loading... Data provided by: Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

展开要点与分析

文章情报

工程师进阶

要点

  • AI 服务暂时不可用,系统已先保留来源内容与降级元数据。
  • arXiv:2608.02886v1 Announce Type: new Abstract: Safely navigating polytopic environments while respecting the dynamics, control, and exact geometry of the underlying system is a c…

要点与分析由自动化流程生成,可能有误,请结合原始来源核实。