REVIEW 1 cited by
Certifiable Reachability Learning Using a New Lipschitz Continuous Value Function
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We propose a new reachability learning framework for high-dimensional nonlinear systems, focusing on reach-avoid problems. These problems require computing the reach-avoid set, which ensures that all its elements can safely reach a target set despite disturbances within pre-specified bounds. Our framework has two main parts: offline learning of a newly designed reachavoid value function, and post-learning certification. Compared to prior work, our new value function is Lipschitz continuous and its associated Bellman operator is a contraction mapping, both of which improve the learning performance. To ensure deterministic guarantees of our learned reach-avoid set, we introduce two efficient post-learning certification methods. Both methods can be used online for real-time local certification or offline for comprehensive certification. We validate our framework in a 12-dimensional crazyflie drone racing hardware experiment and a simulated 10-dimensional highway take-over example.
Forward citations
Cited by 1 Pith paper
-
Bridging Model Predictive Control and Deep Learning for Scalable Reachability Analysis
MPC-generated approximate value labels guide a DeepReach-style network to learn Hamilton-Jacobi reachability solutions, yielding larger verified safe sets in 2D, 7D, 13D, and 40D systems.
Discussion (0). Continue with ORCID to comment.