Reachability of Uncertain Linear Systems Using Zonotopes

We present a method for the computation of reachable sets of uncertain linear systems. The main innovation of the method consists in the use of zonotopes for reachable set representation. Zonotopes are special polytopes with several interesting properties : they can be encoded efficiently, they are closed under linear transformations and Minkowski sum. The resulting method has been used to treat several examples and has shown great performances for high dimensional systems. An extension of the method for the verification of piecewise linear hybrid systems is proposed.

[1]  Eugene Asarin,et al.  Abstraction by Projection and Application to Multi-affine Systems , 2004, HSCC.

[2]  Rajeev Alur,et al.  Reachability Analysis of Hybrid Systems via Predicate Abstraction , 2002, HSCC.

[3]  Thao Dang,et al.  d/dt: a verification tool for hybrid systems , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[4]  T. Dang.  Vérification et synthèse des systèmes hybrides , 2000 .

[5]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[6]  Pravin Varaiya,et al.  Ellipsoidal Techniques for Reachability Analysis , 2000, HSCC.

[7]  Antoine Girard,et al.  Reachability Analysis of Nonlinear Systems Using Conservative Approximation , 2003, HSCC.

[8]  Bruce H. Krogh,et al.  Computational techniques for hybrid system verification , 2003, IEEE Trans. Autom. Control..

[9]  Bruce H. Krogh,et al.  Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations , 1999, HSCC.

[10]  Max Donath,et al.  American Control Conference , 1993 .

[11]  Olaf Stursberg,et al.  Efficient Representation and Computation of Reachable Sets for Hybrid Systems , 2003, HSCC.

[12]  S. Pettersson,et al.  Convergence to Limit Cycles in Hybrid Systems - An Example , 1998 .

[13]  George J. Pappas,et al.  Reachability computation for linear hybrid systems , 1999 .

[14]  Alexandre M. Bayen,et al.  Computational Techniques for the Verification and Control of Hybrid Systems , 2005 .

[15]  Ian M. Mitchell,et al.  Level Set Methods for Computation in Hybrid Systems , 2000, HSCC.

[16]  G. Ziegler.  Lectures on Polytopes , 1994 .

[17]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[18]  George J. Pappas,et al.  Geometric programming relaxations for linear system reachability , 2004, Proceedings of the 2004 American Control Conference.

[19]  Wolfgang Kühn.  Zonotope Dynamics in Numerical Quality Control , 1997, VisMath.

[20]  Alexandre M. Bayen,et al.  Computational techniques for the verification of hybrid systems , 2003, Proc. IEEE.

[21]  Olivier Bournez,et al.  Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems , 2000, HSCC.

[22]  Ashish Tiwari,et al.  Series of Abstractions for Hybrid Automata , 2002, HSCC.

[23]  Sergio Yovine,et al.  Towards Computing Phase Portraits of Polygonal Differential Inclusions , 2002, HSCC.

[24]  蛯原 義雄.  American Control Conference 2004 , 2004 .

[25]  Leonidas J. Guibas,et al.  Zonotopes as bounding volumes , 2003, SODA '03.

[26]  Bernd Sturmfels,et al.  A polyhedral method for solving sparse polynomial systems , 1995 .

[27]  C. Combastel.  A state bounding observer based on zonotopes , 2003, 2003 European Control Conference (ECC).