Exact and Efficient Hamilton-Jacobi Guaranteed Safety Analysis via System Decomposition

Mo Chen1, Sylvia Herbert1, Claire Tomlin1

  • 1UC Berkeley

Details

Category

Regular Papers

Sessions

09:55 - 11:10 | Tue 30 May | Room 4111 | TUA2

Optimization and Optimal Control

Full Text

Abstract

Hamilton-Jacobi (HJ) reachability is a method that provides rigorous analyses of the safety properties of dynamical systems. These guarantees can be provided by the computation of a backward reachable set (BRS), which represents the set of states from which the system may be driven into violating safety properties despite the system's best effort to remain safe. Unfortunately, the complexity of the BRS computation scales exponentially with the number of state dimensions. Although numerous approximation techniques are able to tractably provide conservative estimates of the BRS, they often require restrictive assumptions about system dynamics without providing an exact solution. In this paper we propose a general method for decomposing dynamical systems. Even when the resulting subsystems are coupled, relatively high-dimensional BRSs that were previously intractable or expensive to compute can now be quickly and exactly computed in lower-dimensional subspaces. As a result, the curse of dimensionality is alleviated to a large degree without sacrificing optimality. We demonstrate our theoretical results through a 3D Dubins Car model and a 6D Acrobatic Quadrotor model.

Additional Information

No information added

Video