Choice of Directions for the Approximation of Reachable Sets for Hybrid Systems
In this paper we propose an approach to over-approximate the reachable set (with bounded time and number of transitions) of a hybrid system by a finite set of polytopes. The constraints of the polytope are determined by a direction choice method. For the hybrid systems whose (1) continuous dynamics are linear, (2) invariants and guards are defined by linear inequalities, and (3) variable resets are expressed by invertible affine maps, we show that the over-approximations can be computed in polynomial time, and the overestimation can be arbitrarily reduced by decreasing the discretization time step if the continuous dynamics are all deterministic. Some experimental results are also presented to show the effectiveness of our approach.
KeywordsConvex Hull Hybrid System Linear Inequality Discrete Transition Hybrid Automaton
- 1.Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? In: Proc. of STOC 1995, pp. 373–382. ACM, New York (1995)Google Scholar
- 3.Chutinan, A., Krogh, B.H.: Computing polyhedral approximations to flow pipes for dynamic systems. In: Proc. of CDC 1998. IEEE Press, Los Alamitos (1998)Google Scholar
- 8.Le Guernic, C., Girard, A.: Reachability analysis of linear systems using support functions. Nonlinear Analysis: Hybrid Systems 4(2), 250–262 (2010); IFAC World Congress 2008Google Scholar
- 9.Jolliffe, I.T.: Principal Component Analysis. Springer Series in Statistics (2002)Google Scholar
- 14.Le Guernic, C.: Reachability Analysis of Hybrid Systems with Linear Continuous Dynamics. Ph.d. thesis, Université Joseph Fourier (2009)Google Scholar