Reachability Analysis of Hybrid Systems Using Support Functions
This paper deals with conservative reachability analysis of a class of hybrid systems with continuous dynamics described by linear differential inclusions, convex invariants and guards, and linear reset maps. We present an approach for computing over-approximations of the set of reachable states. It is based on the notion of support function and thus it allows us to consider invariants, guards and constraints on continuous inputs and initial states defined by arbitrary compact convex sets. We show how the properties of support functions make it possible to derive an effective algorithm for approximate reachability analysis of hybrid systems. We use our approach on some examples including the navigation benchmark for hybrid systems verification.
- 8.Varaiya, P.: Reach set computation using optimal control. In: Proc. KIT Workshop on Verification of Hybrid Systems, Grenoble (1998)Google Scholar
- 9.Le Guernic, C., Girard, A.: Reachability analysis of linear systems using support functions. Nonlinear Analysis: Hybrid Systems (2009) (to appear)Google Scholar
- 11.Bertsekas, D., Nedic, A., Ozdaglar, A.: Convex analysis and optimization. Athena Scientific (2003)Google Scholar