High-Order Control Barrier Functions

• High-Order Control Barrier Functions are an advanced extension of classical CBFs that enforce safety constraints in systems with higher relative degree.
• The methodology uses a sequence of auxiliary functions and quadratic programming to adjust control inputs in real time, securing collision avoidance and invariant set constraints.
• Empirical results show efficient real-time execution and scalability, with metrics such as near-zero collisions, high throughput, and precise safety enforcement in dynamic environments.

High-Order Control Barrier Functions (HOCBFs) are an advanced formalism for synthesizing safety filters in real-time control systems, enabling provable safety guarantees for systems with control-affine dynamics and safety constraints that exhibit higher relative degree. HOCBFs extend classical Control Barrier Functions (CBFs) to settings where the control action does not directly influence the first-time derivative of a safety function, and instead manipulates higher-order derivatives. This approach is instrumental in domains such as autonomous driving, multi-agent coordination, and complex robotics, where guaranteeing collision avoidance and invariant set constraints under dynamic and geometric uncertainty is critical.

1. Mathematical Formulation of HOCBFs

In systems with control-affine dynamics,

$\dot{x} = f(x,t) + g(x,t)u,$

a time-varying safety set is specified via a continuously differentiable function $h(x,t)$, with the safe set defined as $\mathcal{C}(t)=\{x: h(x,t)\ge 0\}$. When $h$ has relative degree $m \geq 2$, direct control input $u$ only manifests at the $m$-th derivative level.

HOCBF methodology constructs a sequence of auxiliary functions: $$\psi_0 = h, \quad \psi_k = \frac{d}{dt}\psi_{k-1} + \alpha_k(\psi_{k-1}),\quad k=1,\dots,m,$$ where $\alpha_k(\cdot)$ are extended class-$\mathcal{K}$ functions (typically linear for QP tractability). The crucial safety condition is then

$h(x,t)$0

with $h(x,t)$1 denoting the $h(x,t)$2-th order Lie derivative along $h(x,t)$3 and $h(x,t)$4 for $h(x,t)$5. When applied, this constraint set is enforced within each control cycle.

2. Flexible HOCBF (F-HOCBF) Instantiations

Flexible HOCBFs (F-HOCBFs) refine the base methodology to handle time-varying safety margins and irregularly shaped obstacles. In intersection control for connected and automated vehicles (CAVs) (Shi et al., 8 Nov 2025), the safety function is constructed from geometric primitives: $h(x,t)$6 where $h(x,t)$7 is the minimum distance from the ego position $h(x,t)$8 to the perimeter $h(x,t)$9 of all dynamic obstacles (vehicles treated as adaptive ellipses),

$\mathcal{C}(t)=\{x: h(x,t)\ge 0\}$0

This formulation allows real-time adaptability under non-convex and time-variant geometry.

3. Real-Time Safety Filter: Quadratic Programming Integration

The enforcement of HOCBF constraints is operationalized via Quadratic Programming (QP). For each control loop, the nominal control ($\mathcal{C}(t)=\{x: h(x,t)\ge 0\}$1) produced by trajectory tracking (e.g., LQR/PD controller) is corrected by a minimal adjustment $\mathcal{C}(t)=\{x: h(x,t)\ge 0\}$2 to satisfy the HOCBF constraint: $\mathcal{C}(t)=\{x: h(x,t)\ge 0\}$3 Here, $\mathcal{C}(t)=\{x: h(x,t)\ge 0\}$4 is a slack variable for soft feasibility, $\mathcal{C}(t)=\{x: h(x,t)\ge 0\}$5 and $\mathcal{C}(t)=\{x: h(x,t)\ge 0\}$6 are derived from the Lie derivatives, and $\mathcal{C}(t)=\{x: h(x,t)\ge 0\}$7 modulates constraint violation penalty. This structure enables high-frequency execution (>100 Hz) on embedded hardware using standard QP solvers due to the low dimensionality (2 controls + 1 slack).

4. Coupling With Hierarchical Control and Trajectory Tracking

In hierarchical control architectures for intersection management, the HOCBF filter operates at the bottom execution layer, downstream of discrete-time trajectory planning (offline via differential dynamic programming and online via LQR/PD tracking). The nominal controller tracks a reference trajectory,

$\mathcal{C}(t)=\{x: h(x,t)\ge 0\}$8

while the HOCBF-based QP ensures all outputs $\mathcal{C}(t)=\{x: h(x,t)\ge 0\}$9 keep the system inside dynamically evolving safe sets. The LQR update is performed through Riccati recursion, and feed-forward terms such as $h$0 account for curvature and velocity slip in high-fidelity vehicle models.

5. Computational Complexity and Scalability

The computational burden is dominated by per-cycle QP and geometric search (for $h$1), plus discrete Riccati updates for tracking. Per the simulation data (Shi et al., 8 Nov 2025),

• Each vehicle executes one 3-variable QP, geometric collision search (5–8 golden-section grid points), and controller update in under 1 ms.
• Achievable control loop frequency is routinely in the 150–200 Hz range for up to a few dozen vehicles.
• The top-layer fairness allocator operates in $h$2 per cycle, with $h$3 yielding sub-millisecond allocation runtimes.

This suggests the F-HOCBF approach is compatible with stringent real-time and scalability requirements in dense multi-agent environments characteristic of urban intersections.

6. Empirical Performance and Safety Guarantees

In simulation, HOCBF-based safety filtering—integrated into fairness-aware hierarchical control—produces:

• Zero collision occurrences across all tested scenarios
• Minimum inter-vehicular distance tightly controlled (≈0.14 m in dense traffic, never violating $h$4 m)
• High fairness (Jain’s index $h$5, Gini ≈ 0.05 under heavy unbalanced demand)
• Efficiency improvements: throughput up to 3,480 veh/hr (vs. baseline 1,440 veh/hr), reduced average delay (3.92 s vs. 5.06 s), and lower delay variance (1.28 s vs. 1.90 s)
• Real-time feasibility with 10th–90th percentile loop rates in [100 Hz, 250 Hz]

7. Limitations, Extensions, and Broader Applicability

Current HOCBF instantiations in intersection control authorize only a single vehicle per cycle; multi-slot allocation (with concurrent non-conflicting agents) remains a potential extension. The general HOCBF methodology is suitable for other domains requiring the enforcement of safety constraints with higher relative degree, including aerial robotics, multi-agent racing games (where discrete rules are tracked by continuous HOCBF-based controllers), and swarms under dynamic obstacle fields.

Further research avenues include learning-based parameter tuning for the class-$h$6 functions, hardware-in-the-loop validation under stochastic sensor delays, and expansion to mixed-autonomy settings with heterogeneous agent behaviors.

---

In summary, High-Order Control Barrier Functions form a mathematically rigorous and practically scalable foundation for enforcing complex safety constraints in real-time hierarchical control systems. Their integration into fairness-aware control architectures demonstrates that strict safety and fairness guarantees are achievable simultaneously, at real-time control rates, under adversarial dynamic conditions (Shi et al., 8 Nov 2025).