Certifiable Reachability Learning Using a New Lipschitz Continuous Value Function
We propose a new reachability learning framework for high-dimensional nonlinear systems, focusing on <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">reach-avoid problems</i>. These problems require computing the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">reach-avoid set</i>, 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 reach-avoid 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.
Authors
- Claire J. Tomlin (ORCID: https://orcid.org/0000-0003-3192-3185)
- Jingqi Li (ORCID: https://orcid.org/0000-0002-3731-3807)
- Somayeh Sojoudi
- Donggun Lee (ORCID: https://orcid.org/0000-0003-4073-1353)
- Jaewon Lee (ORCID: https://orcid.org/0000-0001-5681-217X)
- Kris Shengjun Dong
Institutions
- North Carolina State University (US)
- Gleason (United States) (US)
- Bose (United States) (US)
- University of California, Berkeley (US)
Publication Details
- Journal
- IEEE Robotics and Automation Letters
- Published
- 2025-01-27
- DOI
- https://doi.org/10.1109/lra.2025.3535183
- Primary Topic
- Multi-Criteria Decision Making
- Type
- article
- Field-Weighted Citation Impact
- 0.00