Saved in:
Bibliographic Details
Main Authors: Kim, Matthew, Sharpless, William, Jeong, Hyun Joe, Tonkens, Sander, Bansal, Somil, Herbert, Sylvia
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2505.11755
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910954779836416
author Kim, Matthew
Sharpless, William
Jeong, Hyun Joe
Tonkens, Sander
Bansal, Somil
Herbert, Sylvia
author_facet Kim, Matthew
Sharpless, William
Jeong, Hyun Joe
Tonkens, Sander
Bansal, Somil
Herbert, Sylvia
contents Recent developments in autonomous driving and robotics underscore the necessity of safety-critical controllers. Control barrier functions (CBFs) are a popular method for appending safety guarantees to a general control framework, but they are notoriously difficult to generate beyond low dimensions. Existing methods often yield non-differentiable or inaccurate approximations that lack integrity, and thus fail to ensure safety. In this work, we use physics-informed neural networks (PINNs) to generate smooth approximations of CBFs by computing Hamilton-Jacobi (HJ) optimal control solutions. These reachability barrier networks (RBNs) avoid traditional dimensionality constraints and support the tuning of their conservativeness post-training through a parameterized discount term. To ensure robustness of the discounted solutions, we leverage conformal prediction methods to derive probabilistic safety guarantees for RBNs. We demonstrate that RBNs are highly accurate in low dimensions, and safer than the standard neural CBF approach in high dimensions. Namely, we showcase the RBNs in a 9D multi-vehicle collision avoidance problem where it empirically proves to be 5.5x safer and 1.9x less conservative than the neural CBFs, offering a promising method to synthesize CBFs for general nonlinear autonomous systems.
format Preprint
id arxiv_https___arxiv_org_abs_2505_11755
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Reachability Barrier Networks: Learning Hamilton-Jacobi Solutions for Smooth and Flexible Control Barrier Functions
Kim, Matthew
Sharpless, William
Jeong, Hyun Joe
Tonkens, Sander
Bansal, Somil
Herbert, Sylvia
Robotics
Artificial Intelligence
Recent developments in autonomous driving and robotics underscore the necessity of safety-critical controllers. Control barrier functions (CBFs) are a popular method for appending safety guarantees to a general control framework, but they are notoriously difficult to generate beyond low dimensions. Existing methods often yield non-differentiable or inaccurate approximations that lack integrity, and thus fail to ensure safety. In this work, we use physics-informed neural networks (PINNs) to generate smooth approximations of CBFs by computing Hamilton-Jacobi (HJ) optimal control solutions. These reachability barrier networks (RBNs) avoid traditional dimensionality constraints and support the tuning of their conservativeness post-training through a parameterized discount term. To ensure robustness of the discounted solutions, we leverage conformal prediction methods to derive probabilistic safety guarantees for RBNs. We demonstrate that RBNs are highly accurate in low dimensions, and safer than the standard neural CBF approach in high dimensions. Namely, we showcase the RBNs in a 9D multi-vehicle collision avoidance problem where it empirically proves to be 5.5x safer and 1.9x less conservative than the neural CBFs, offering a promising method to synthesize CBFs for general nonlinear autonomous systems.
title Reachability Barrier Networks: Learning Hamilton-Jacobi Solutions for Smooth and Flexible Control Barrier Functions
topic Robotics
Artificial Intelligence
url https://arxiv.org/abs/2505.11755