Classification-based Approximate Reachability with Guarantees Applied to Safe Trajectory Tracking
Hamilton-Jacobi (HJ) reachability analysis has been developed over the past decades into a widely-applicable tool for determining goal satisfaction and safety verification in nonlinear systems. While HJ reachability can be formulated very generally, computational complexity can be a serious impediment for many systems of practical interest. Much prior work has been devoted to computing approximate solutions to large reachability problems, yet many of these methods apply to only restricted problem classes, do not generate controllers, and/or are extremely conservative. In this paper, we present a novel approach to approximate HJ reachability in which computing an optimal controller is viewed as a sequential classification problem. Even though we employ neural networks for this classification task, our method still provides safety guarantees in many cases. We demonstrate the utility of our approach in the context of safe trajectory following with specific application to quadrotor navigation. Offline computation and online evaluation confirm that our method preserves safety.
READ FULL TEXT