Geometry-Aware Control Barrier Functions for Collision Avoidance via Bernstein Polynomial Approximations

• URL: http://arxiv.org/abs/2605.30696v1
• Date: Fri, 29 May 2026 00:42:33 GMT
• Title: Geometry-Aware Control Barrier Functions for Collision Avoidance via Bernstein Polynomial Approximations
• Abstract summary: We introduce a novel geometry-aware Control Barrier Function (CBF) based on Bernstein-Polynomial Signed Distance Fields (BPSDF)<n>We validate the method's efficiency and performance to inflate single-robot navigation and heterogeneous multi-robot collision avoidance via simulations under different environments.
• Score: 8.629680427261542
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Safe navigation often relies on well-defined conditions based on the shape of robots and obstacles, and can be challenging when they have irregular geometries. While Control Barrier Functions (CBFs) offer an efficient mechanism to enforce safe set forward invariance, common shape surrogates (e.g., spheres or super-ellipsoids) either are overly conservative in unstructured scenes or require many local primitives, which inflates constraint counts and degrades real-time performance. In this paper, we introduce a novel geometry-aware Control Barrier Function (CBF) based on Bernstein-Polynomial Signed Distance Fields (BP-SDFs). It provides a unified way to represent the obstacles and robots, so as to represent the barrier function with a unified minimum distance. Benefiting from the differentiability of the Bernstein polynomials, one can easily enforce the control constraints in a closed loop. We validate the method's efficiency and performance to guarantee safety in single-robot navigation and heterogeneous multi-robot collision avoidance via simulations under different environments.

Related papers

• Control Barrier Functions via Minkowski Operations for Safe Navigation among Polytopes [6.281375484813414]
  We propose an exact Signed Distance Function (SDF) formulation for a it polytopic robot and it polytopic obstacles.<n>The proposed method computes the exact SDF via companion convex programs in both the collision-free (positive-sign) and in-collision (negative-sign) cases.
  arXiv  Detail & Related papers  (2026-08-03T21:15:23Z)
• Distributed Motion Planning with Safety Guarantees for Self-Reconfiguring Robotic Boats [76.98547580312116]
  This paper proposes a hybrid framework that combines distributed Model Predictive Control (MPC) with Control Barrier Functions (CBFs)<n>To ensure safety in real time, distributed CBF-based filters are applied to enforce inter-agent avoidance.
  arXiv  Detail & Related papers  (2026-07-22T16:37:05Z)
• Real-Time and Accurate Collision-Free Teleoperation via Differentiable Constraint-Based Trajectory Planning [1.4699455652461726]
  A common strategy to mitigate this issue is to enhance the operator's input using optimal-control-based trajectory planning.<n>We adapt a recent formulation of differentiable collision-avoidance constraints, based on duality in convex optimization, to the teleoperation setting.<n>Results show that our approach achieves lower computation times while enabling more accurate obstacle modeling.
  arXiv  Detail & Related papers  (2026-06-07T16:39:56Z)
• Verification and Forward Invariance of Control Barrier Functions for Differential-Algebraic Systems [11.911696730476676]
  This paper introduces DAE-aware control barrier functions (CBFs) that incorporate the differential-algebraic structure through projected vector fields.<n>A systematic verification framework is developed, establishing necessary and sufficient conditions for DAE-aware CBFs.<n>The approach is validated on wind turbine and flexible-link manipulator systems.
  arXiv  Detail & Related papers  (2026-03-13T18:40:31Z)
• Iterative Convex Optimization with Control Barrier Functions for Obstacle Avoidance among Polytopes [3.8436274588467696]
  Obstacle avoidance by polytopic robots is a challenging problem in optimization-based control and trajectory planning.<n>Existing methods rely on hyperiable distance approximations, such as ellipsoids, which distort geometric dynamics.<n>In this paper, we propose a novel iterative convexity- finite-horizon optimization framework for safety-critical navigation programs.
  arXiv  Detail & Related papers  (2026-03-06T05:10:44Z)
• U-OBCA: Uncertainty-Aware Optimization-Based Collision Avoidance via Wasserstein Distributionally Robust Chance Constraints [20.749251189493563]
  Uncertainty arising from localization error, trajectory prediction errors of the moving obstacles and environmental disturbances pose significant challenges to robot's safe navigation.<n>Existing uncertainty-aware planners often approximate polygon-shaped robots and obstacles using simple geometric primitives such as circles or ellipses.<n>We extend the Optimization-Based Collision Avoidance framework to an uncertainty-aware formulation, termed emphU-OBCA.<n>We show that U-OBCA significantly mitigates the conservatism in trajectory planning and achieves higher navigation efficiency compared to existing baseline methods.
  arXiv  Detail & Related papers  (2026-03-05T07:59:09Z)
• BarrierSteer: LLM Safety via Learning Barrier Steering [83.12893815611052]
  BarrierSteer is a novel framework that formalizes safety by embedding learned non-linear safety constraints directly into the model's latent representation space.<n>We show that BarrierSteer substantially reduces adversarial success rates, decreases unsafe generations, and outperforms existing methods.
  arXiv  Detail & Related papers  (2026-02-23T18:19:46Z)
• SQ-CBF: Signed Distance Functions for Numerically Stable Superquadric-Based Safety Filtering [9.291918812545699]
  Control barrier functions provide an effective framework for real-time safety filtering.<n>Their performance depends on the underlying geometric representation, which is often simplified.<n>Superquadrics offer an expressive way to model complex shapes using a few primitives.
  arXiv  Detail & Related papers  (2026-02-11T17:19:43Z)
• Pareto Control Barrier Function for Inner Safe Set Maximization Under Input Constraints [50.920465513162334]
  We introduce the PCBF algorithm to maximize the inner safe set of dynamical systems under input constraints.<n>We validate its effectiveness through comparison with Hamilton-Jacobi reachability for an inverted pendulum and through simulations on a 12-dimensional quadrotor system.<n>Results show that the PCBF consistently outperforms existing methods, yielding larger safe sets and ensuring safety under input constraints.
  arXiv  Detail & Related papers  (2024-10-05T18:45:19Z)
• Safe Neural Control for Non-Affine Control Systems with Differentiable Control Barrier Functions [58.19198103790931]
  This paper addresses the problem of safety-critical control for non-affine control systems. It has been shown that optimizing quadratic costs subject to state and control constraints can be sub-optimally reduced to a sequence of quadratic programs (QPs) by using Control Barrier Functions (CBFs) We incorporate higher-order CBFs into neural ordinary differential equation-based learning models as differentiable CBFs to guarantee safety for non-affine control systems.
  arXiv  Detail & Related papers  (2023-09-06T05:35:48Z)
• BarrierNet: A Safety-Guaranteed Layer for Neural Networks [50.86816322277293]
  BarrierNet allows the safety constraints of a neural controller be adaptable to changing environments. We evaluate them on a series of control problems such as traffic merging and robot navigations in 2D and 3D space.
  arXiv  Detail & Related papers  (2021-11-22T15:38:11Z)
• Learning Control Barrier Functions from Expert Demonstrations [69.23675822701357]
  We propose a learning based approach to safe controller synthesis based on control barrier functions (CBFs) We analyze an optimization-based approach to learning a CBF that enjoys provable safety guarantees under suitable Lipschitz assumptions on the underlying dynamical system. To the best of our knowledge, these are the first results that learn provably safe control barrier functions from data.
  arXiv  Detail & Related papers  (2020-04-07T12:29:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.