Validating a Hamilton-Jacobi approximation to hybrid system reachable sets

64Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We develop a general framework for solving the hybrid system reachability problem, and indicate how several published techniques fit into this framework. The key unresolved need of any hybrid system reachability algorithm is the computation of continuous reachable sets; consequently, we present new results on techniques for calculating numerical approximations of such sets evolving under general nonlinear dynamics with inputs. Our tool is based on a local level set procedure for boundary propagation in continuous state space, and has been implemented using numerical schemes of varying orders of accuracy. We demonstrate the numerical convergence of these schemes to the viscosity solution of the Hamilton-Jacobi equation, which was shown in earlier work to be the exact representation of the boundary of the reachable set. We then describe and solve a new benchmark example in nonlinear hybrid systems: an auto-lander for a commercial aircraft in which the switching logic and continuous control laws are designed to maximize the safe operating region across the hybrid state space.

Cite

CITATION STYLE

APA

Mitchell, I., Bayen, A. M., & Tomlin, C. J. (2001). Validating a Hamilton-Jacobi approximation to hybrid system reachable sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2034, pp. 418–432). Springer Verlag. https://doi.org/10.1007/3-540-45351-2_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free