Solving Reach- and Stabilize-Avoid Problems Using Discounted Reachability
Boyang Li, Zheng Gong, and Sylvia Herbert

TL;DR
This paper develops a Hamilton-Jacobi reachability framework for infinite-horizon reach-avoid and stabilize-avoid problems in nonlinear systems, providing new value functions and verification methods.
Contribution
It introduces a Lipschitz continuous reach-avoid value function with a contractive Bellman operator and integrates it with control Lyapunov functions for stabilization.
Findings
Validated on a 3D Dubins car system demonstrating effectiveness.
Established the uniqueness of the viscosity solution for the Hamilton-Jacobi variational inequality.
Abstract
In this article, we consider the infinite-horizon reach-avoid (RA) and stabilize-avoid (SA) zero-sum game problems for general nonlinear continuous-time systems, where the goal is to find the set of states that can be controlled to reach or stabilize to a target set, without violating constraints even under the worst-case disturbance. Based on the Hamilton-Jacobi reachability method, we address the RA problem by designing a new Lipschitz continuous RA value function, whose zero sublevel set exactly characterizes the RA set. We establish that the associated Bellman backup operator is contractive and that the RA value function is the unique viscosity solution of a Hamilton-Jacobi variational inequality. Finally, we develop a two-step framework for the SA problem by integrating our RA strategies with a recently proposed Robust Control Lyapunov-Value Function, thereby ensuring both target…
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
TopicsFormal Methods in Verification · Software Reliability and Analysis Research · Logic, programming, and type systems
