eess.SYNov 18, 2026

Control-Aware Separating Hyperplanes for Control Barrier Functions in Planar Navigation

Authors: Aadarsh Ramachandiran, Rachel Kalpana Kalaimani

Organizations: Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai 600036, India

Abstract

Separating hyperplanes are widely used in Control Barrier Function (CBF)-based collision avoidance, yet their orientations strongly govern control intervention-the deviation of the applied control from the robot's nominal command. Existing methods typically select hyperplane orientations from geometry alone. Jointly optimizing orientations and control yields a continuous, non-convex problem in which local nonlinear solvers suffer from initialization sensitivity, local minima, and unpredictable latency, while discretized orientation grids scale exponentially with obstacle count. For planar navigation of a polygonal robot among polygonal obstacles, we present a solver-free, control-aware separating hyperplane selection method that directly computes a global optimum of this joint problem at each step whenever it is feasible. Exploiting the geometry of Minkowski difference polygons, we reduce this continuous non-convex optimization to evaluating a polynomial-size set of candidate control interventions via closed-form algebraic checks, selecting the feasible candidate of minimum norm. Across 250 simulated navigation scenarios, our method reduces cumulative intervention cost by 3.6% at the median and 27.3% at the 90th percentile compared to a local nonlinear solver, and completion time by 0.6% and 5.6%, respectively. In scalability benchmarks, it achieves a 6.1x per-step speedup at 16 simultaneous obstacles.

Figures & tables

Explore similar work

Mar 6, 2026

Iterative Convex Optimization with Control Barrier Functions for Obstacle Avoidance among Polytopes

Obstacle avoidance of polytopic obstacles by polytopic robots is a challenging problem in optimization-based control and trajectory planning. Many existing methods rely on smooth geometric approximations, such as hyperspheres or ellipsoids, which allow differentiable distance expressions but distort the true geometry and restrict the feasible set. Other approaches integrate exact polytope distances into nonlinear model predictive control (MPC), resulting in nonconvex programs that limit real-time performance. In this paper, we construct linear discrete-time control barrier function (DCBF) constraints by deriving supporting hyperplanes from exact closest-point computations between convex polytopes. We then propose a novel iterative convex MPC-DCBF framework, where local linearization of system dynamics and robot geometry ensures convexity of the finite-horizon optimization at each iteration. The resulting formulation reduces computational complexity and enables fast online implementation for safety-critical control and trajectory planning of general nonlinear dynamics. The framework extends to multi-robot and three-dimensional environments. Numerical experiments demonstrate collision-free navigation in cluttered maze scenarios with millisecond-level solve times.
May 29, 2026

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

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) are either 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.
Aug 3, 2026

Control Barrier Functions via Minkowski Operations for Safe Navigation among Polytopes

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.