Generating Formal Safety Assurances for High-Dimensional Reachability
Albert Lin, Somil Bansal

TL;DR
This paper introduces a method to compute error bounds for neural PDE solvers in high-dimensional reachability analysis, enabling safe approximations of reachable sets for complex autonomous systems.
Contribution
It proposes a novel approach to quantify and correct neural network-based reachability solutions, ensuring formal safety guarantees in high-dimensional systems.
Findings
Successfully applied to rocket-landing scenarios
Achieved probabilistically safe reachable tubes
Enhanced safety assurances for multi-vehicle collision avoidance
Abstract
Providing formal safety and performance guarantees for autonomous systems is becoming increasingly important. Hamilton-Jacobi (HJ) reachability analysis is a popular formal verification tool for providing these guarantees, since it can handle general nonlinear system dynamics, bounded adversarial system disturbances, and state and input constraints. However, it involves solving a PDE, whose computational and memory complexity scales exponentially with respect to the state dimensionality, making its direct use on large-scale systems intractable. A recently proposed method called DeepReach overcomes this challenge by leveraging a sinusoidal neural PDE solver for high-dimensional reachability problems, whose computational requirements scale with the complexity of the underlying reachable tube rather than the state space dimension. Unfortunately, neural networks can make errors and thus the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Formal Methods in Verification · Safety Systems Engineering in Autonomy
