Table of Contents
Fetching ...

No Minima, No Collisions: Combining Modulation and Control Barrier Function Strategies for Feasible Dynamic Collision Avoidance

Yifan Xue, Nadia Figueroa

TL;DR

This work investigates dynamic obstacle avoidance by juxtaposing Control Barrier Function Quadratic Programs (CBF-QPs) with Mod-DS methods, showing both offer complementary safety and trajectory properties. It reveals theoretical connections—normal Mod-DS is equivalent to CBF-QP in static fully actuated settings, and reference Mod-DS relates closely through a shared equation—leading to the Modulated CBF-QP (MCBF-QP) framework. MCBF-QP introduces two variants, Reference-MCBF-QP and On-Manifold-MCBF-QP, to reduce or eliminate undesirable local minima while preserving actuation constraints, validated through hospital-like simulations and real-robot experiments on Ridgeback and Fetch platforms. The results demonstrate improved target convergence, obstacle clearance, and robustness across fully actuated and underactuated systems, suggesting a practical, unified approach to safe navigation in dynamic, cluttered environments.

Abstract

Control Barrier Function Quadratic Programs (CBF-QPs) have become a central tool for real-time safety-critical control due to their applicability to general control-affine systems and their ability to enforce constraints through optimization. Yet, they often generate trajectories with undesirable local minima that prevent convergence to goals. On the other hand, Modulation of Dynamical Systems (Mod-DS) methods (including normal, reference, and on-manifold variants) reshape nominal vector fields geometrically and achieve obstacle avoidance with few or even no local minima. However, Mod-DS provides no straightforward mechanism for handling input constraints and remains largely restricted to fully actuated systems. In this paper, we revisit the theoretical foundations of both approaches and show that, despite their seemingly different constructions, the normal Mod-DS is a special case of the CBF-QP, and the reference Mod-DS is linked to the CBF-QP through a single shared equation. These connections motivate our Modulated CBF-QP (MCBF-QP) framework, which introduces reference and on-manifold modulation variants that reduce or fully eliminate the spurious equilibria inherent to CBF-QPs for general control-affine systems operating in dynamic, cluttered environments. We validate the proposed controllers in simulated hospital settings and in real-world experiments on fully actuated Ridgeback robots and underactuated Fetch platforms. Across all evaluations, Modulated CBF-QPs consistently outperform standard CBF-QPs on every performance metric.

No Minima, No Collisions: Combining Modulation and Control Barrier Function Strategies for Feasible Dynamic Collision Avoidance

TL;DR

This work investigates dynamic obstacle avoidance by juxtaposing Control Barrier Function Quadratic Programs (CBF-QPs) with Mod-DS methods, showing both offer complementary safety and trajectory properties. It reveals theoretical connections—normal Mod-DS is equivalent to CBF-QP in static fully actuated settings, and reference Mod-DS relates closely through a shared equation—leading to the Modulated CBF-QP (MCBF-QP) framework. MCBF-QP introduces two variants, Reference-MCBF-QP and On-Manifold-MCBF-QP, to reduce or eliminate undesirable local minima while preserving actuation constraints, validated through hospital-like simulations and real-robot experiments on Ridgeback and Fetch platforms. The results demonstrate improved target convergence, obstacle clearance, and robustness across fully actuated and underactuated systems, suggesting a practical, unified approach to safe navigation in dynamic, cluttered environments.

Abstract

Control Barrier Function Quadratic Programs (CBF-QPs) have become a central tool for real-time safety-critical control due to their applicability to general control-affine systems and their ability to enforce constraints through optimization. Yet, they often generate trajectories with undesirable local minima that prevent convergence to goals. On the other hand, Modulation of Dynamical Systems (Mod-DS) methods (including normal, reference, and on-manifold variants) reshape nominal vector fields geometrically and achieve obstacle avoidance with few or even no local minima. However, Mod-DS provides no straightforward mechanism for handling input constraints and remains largely restricted to fully actuated systems. In this paper, we revisit the theoretical foundations of both approaches and show that, despite their seemingly different constructions, the normal Mod-DS is a special case of the CBF-QP, and the reference Mod-DS is linked to the CBF-QP through a single shared equation. These connections motivate our Modulated CBF-QP (MCBF-QP) framework, which introduces reference and on-manifold modulation variants that reduce or fully eliminate the spurious equilibria inherent to CBF-QPs for general control-affine systems operating in dynamic, cluttered environments. We validate the proposed controllers in simulated hospital settings and in real-world experiments on fully actuated Ridgeback robots and underactuated Fetch platforms. Across all evaluations, Modulated CBF-QPs consistently outperform standard CBF-QPs on every performance metric.

Paper Structure

This paper contains 35 sections, 69 equations, 13 figures, 5 tables.

Figures (13)

  • Figure 1: Real-world experiments in (a) crowd navigation, (b) adversarial attack scenarios, and (c) concave obstacle navigation, together with a simulated experiment in (d) hospital navigation using Gazebo. All experiments are conducted using the proposed MCBF-QP strategy (Section \ref{['sec:mod-cbf']}) for local-minimum-free navigation in complex and dynamic environments.
  • Figure 2: Isolines displaying (a) $h_{\text{conv}}$, (b) $h_{\text{star}}$, and (c) $h_\text{nstar}$ in the proximity of respectively a circle, a funnel, and a C-shaped obstacle.
  • Figure 3: Comparison of obstacle avoidance methods around convex, star-shaped, and non-star-shaped obstacles under the nominal linear DS in Eq. \ref{['eq:nominal system']} with $\epsilon=2$. Row 1-4 show CBF-QPs with different $\mathcal{K}_{\infty}$ functions $\alpha(h)$, and the remaining rows show Mod-DS variants. Streamline colors represent the ratio of modified to nominal speeds, $\|u\|_2 / \|u_{\text{nom}}\|_2$.
  • Figure 4: Trajectories from 10 initial locations toward a target at the origin generated by CBF-QP (columns a-b) and Mod-DS (column c-e) obstacle avoidance methods around 1) a convex, 2) a star-shaped, and 3) a non-star-shaped obstacle. The nominal controller is $\epsilon = \frac{1}{\|x\|_2}$ (Eq. \ref{['eq:nominal system']}). Colors along the trajectories indicate the robot speed magnitude at each state $x$.
  • Figure 5: Performance of the normal Mod-DS given $\lambda$, $\lambda_e$ in Eq. \ref{['eq:lambda value for equivalence']} equivalent to that of CBF-QP with $\alpha(h)=h$ in \ref{['fig:comparison']}.
  • ...and 8 more figures

Theorems & Definitions (5)

  • Definition 2.1: Local Minimum in Robot Navigation
  • Definition 3.1: Nagumo Set Invariance
  • Definition 3.2: Extended $K_{\infty}$ Functions
  • Definition 3.3: Reference Points in Star-Shaped Obstacles
  • Definition 5.1: Local Minima in Mod-DS