Robust safety guarantees for nonholonomic robots navigating active obstacles

Adversarially Robust Geometric Safety Certificates for Nonholonomic Robots Against Maneuvering Obstacles

RoboticsMultiagent Systems

Summary

Keeping robots safe when moving around obstacles that can actively move is tough. The authors developed a new mathematical way to define safe zones that consider the worst actions obstacles might take. Their method simplifies complex calculations by focusing on a specific geometric property, making it easier and more reliable for robots with steering limits to avoid collisions. They also include a way to estimate unknown obstacle abilities and adjust safety zones accordingly. Tests with simulations show that their approach reduces accidents better than other safety methods.

What this means in practice

  • For autonomous vehicle engineers: Provide precise safety guarantees for car-like robots navigating busy environments with moving obstacles by accounting for worst-case obstacle maneuvers.
  • For mobile robot developers: Enable efficient real-time safe path planning for robots with steering constraints facing dynamic obstacles by embedding geometric robustness directly into safety certificates.

Authors

Chandan Kumar Sah, Bazeela Banday, Jishnu Keshavan

Abstract

Safe navigation against obstacles that can actively maneuver within bounded capabilities remains challenging: robust control barrier function methods typically treat obstacle actions as generic disturbances, while differential-game approaches are computationally expensive for online navigation. We propose an adversarially robust geometric certificate that accounts for the worst-case effect of admissible obstacle maneuvers directly in the safe-set geometry through a closed-form contraction of the certificate parameters. The construction exploits a structural property of line-of-sight (LoS) certificates: the robot and obstacle actions enter the certificate through a common state-dependent geometric gain. This gain cancels in the worst-case comparison, reducing the differential game to a direct comparison between obstacle maneuvering capability and the weaker of the robot's longitudinal and steering authorities. Instantiated on the parabolic certificate, the construction yields Adversarially Robust Dynamic Parabolic Control Barrier Functions (AR-DPCBF), for which we establish sufficient conditions for forward invariance of the contracted safe set against all admissible obstacle maneuvers under kinematic bicycle dynamics with bounded inputs. When the obstacle capability is unknown, a sliding-window estimator supplies a high-probability upper bound, allowing the guarantee to be retained with the corresponding coverage probability. We further formulate soft and buffered variants to recover feasibility in dense environments. Simulations across obstacle capabilities, densities, and capability mismatch show substantial reductions in barrier violations and collisions and demonstrate that pointwise robustification of the barrier derivative cannot substitute for contraction of its geometry.