Abstract
In this paper, we are concerned with the problem of computing the reachable sets of hybrid systems with (possibly high dimensional) linear continuous dynamics and guards defined by switching hyperplanes. For the reachability analysis of the continuous dynamics, we use an efficient approximation algorithm based on zonotopes. In order to use this technique for the analysis of hybrid systems, we must also deal with the discrete transitions in a satisfactory (i.e. scalable and accurate) way. For that purpose, we need to approximate the intersection of the continuous reachable sets with the guards enabling the discrete transitions. The main contribution of this paper is a novel algorithm for computing efficiently a tight over-approximation of the intersection of (possibly high-order) zonotopes with a hyperplane. We show the accuracy and the scalability of our approach by considering two examples of reachability analysis of hybrid systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Varaiya, P.: Reach set computation using optimal control. In: Proc. KIT Workshop on Verification of Hybrid Systems, Verimag, Grenoble (1998)
Chutinan, A., Krogh, B.H.: Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol. 1569, pp. 76–90. Springer, Heidelberg (1999)
Asarin, E., Dang, T., Maler, O., Bournez, O.: Approximate reachability analysis of piecewise-linear dynamical systems. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 20–31. Springer, Heidelberg (2000)
Kurzhanski, A.B., Varaiya, P.: Ellipsoidal techniques for reachability analysis. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 202–214. Springer, Heidelberg (2000)
Mitchell, I., Tomlin, C.: Level set methods for computation in hybrid systems. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 310–323. Springer, Heidelberg (2000)
Stursberg, O., Krogh, B.H.: Efficient representation and computation of reachable sets for hybrid systems. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol. 2623, pp. 482–497. Springer, Heidelberg (2003)
Girard, A.: Reachability of uncertain linear systems using zonotopes. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 291–305. Springer, Heidelberg (2005)
Girard, A., Le Guernic, C., Maler, O.: Efficient computation of reachable sets of linear time-invariant systems with inputs. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 257–271. Springer, Heidelberg (2006)
Kurzhanskiy, A.A., Varaiya, P.: Ellipsoidal techniques for reachability analysis of discrete-time linear systems. IEEE Trans. Automatic Control 52, 26–38 (2007)
Asarin, E., Bournez, O., Dang, T., Maler, O., Pnueli, A.: Effective synthesis of switching controllers for linear systems. Proc. of the IEEE 88(7), 1011–1025 (2000)
Dang, T.: Vérification et Synthèse des Systèmes Hybrides. PhD thesis, Institut National Polytechnique de Grenoble (2000)
Maler, O.: Control from computer science. IFAC Annual Reviews in Control (2003)
Tomlin, C., Mitchell, I., Bayen, A., Oishi, M.: Computational techniques for the verification and control of hybrid systems. Proc. of the IEEE 91(7), 986–1001 (2003)
Ziegler, G.M.: Lectures on Polytopes. In: Graduate Texts in Mathematics, vol. 152, Springer, Heidelberg (1995)
Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1-3), 21–46 (1996)
Zaslavsky, T.: Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes. In: Memoirs of the American Mathematical Society. American Mathematical Society, vol. 154 (1975)
Jarvis, R.A.: On the identification of the convex hull of a finite set of points in the plane. Inf. Process. Lett. 2(1), 18–21 (1973)
Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448–461 (1973)
Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Operations Research 28(5), 1130–1154 (1980)
Bern, M.W., Eppstein, D.: Optimization over zonotopes and training support vector machines (2001) Talk given at WADS
Guibas, L.J., Nguyen, A., Zhang, L.: Zonotopes as bounding volumes. In: SODA 2003: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 803–812 (2003)
Muller, M.E.: A note on a method for generating points uniformly on n-dimensional spheres. Commun. ACM 2(4), 19–20 (1959)
Leroy, X.: The Objective Caml system. In: INRIA (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Girard, A., Le Guernic, C. (2008). Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis. In: Egerstedt, M., Mishra, B. (eds) Hybrid Systems: Computation and Control. HSCC 2008. Lecture Notes in Computer Science, vol 4981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78929-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-78929-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78928-4
Online ISBN: 978-3-540-78929-1
eBook Packages: Computer ScienceComputer Science (R0)