Convexity of reachable sets of nonlinear discrete-time systems

We present necessary and sufficient conditions for reachable sets of discrete-time systems x(k+1) = F (k, x(k)) to be convex. In particular, the set of states reachable at a give n time from a sufficiently small ellipsoid of initial states is always convex if F is smooth enough, and we provide explicit bounds on the size of those ellipsoids. Our results imply that outer discrete approximations with approximation depth exceeding 1 can be readily computed up to arbitrary precision. A further potential application is outer polyhedral approximation of reachable sets, which becomes almost universally applicable if those sets are known to be convex.

[1]  B. Krogh,et al.  Synthesis of supervisory controllers for hybrid systems based on approximating automata , 1998, IEEE Trans. Autom. Control..

[2]  Michel Kinnaert,et al.  Diagnosis and Fault-Tolerant Control , 2004, IEEE Transactions on Automatic Control.

[3]  V. Borkar,et al.  /spl epsiv/-approximation of differential inclusions , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[4]  Jörg Raisch,et al.  Abstraction based supervisory controller synthesis for high order monotone continuous systems , 2002 .

[5]  Dusan M. Stipanovic,et al.  Polytopic Approximations of Reachable Sets Applied to Linear Dynamic Games and a Class of Nonlinear Systems , 2005 .

[6]  O. Junge,et al.  A set oriented approach to global optimal control , 2004 .

[7]  B. T. Polyak,et al.  CONVEXITY OF THE REACHABLE SET OF NONLINEAR SYSTEMS UNDER L 2 BOUNDED CONTROLS , 2022 .

[8]  Jörg Raisch,et al.  Discrete approximation and supervisory control of continuous systems , 1998, IEEE Trans. Autom. Control..

[9]  S. Łojasiewicz.  Some properties of accessible sets in non-linear control systems , 1979 .

[10]  Boris Polyak.  Convexity of Nonlinear Image of a Small Ball with Applications to Optimization , 2001 .

[11]  M. V. Topunov.  The convexity of the reachable set for a bilinear controllable system , 2003 .

[12]  A. Pliś.  ACCESSIBLE SETS IN CONTROL THEORY , 1975 .

[13]  C. S. Hsu,et al.  Cell-to-Cell Mapping , 1987 .

[14]  J. Lunze,et al.  Computation of complete abstractions of quantised systems , 2001, 2001 European Control Conference (ECC).

[15]  S. V. Emel'yanov,et al.  Convexity of Images of Convex Sets under Smooth Maps , 2004 .

[16]  Paul I. Barton,et al.  Global Optimization with Nonlinear Ordinary Differential Equations , 2006, J. Glob. Optim..

[17]  G. Gorni,et al.  Local homeo- and diffeomorphisms: invertibility and convex image , 1994, Bulletin of the Australian Mathematical Society.

[18]  On the Closure and Convexity of Attainable Sets in Finite and Infinite Dimensions , 1967 .

[19]  Oliver Junge,et al.  Rigorous discretization of subdivision techniques , 2000 .

[20]  D. Szolnoki.  Set oriented methods for computing reachable sets and control sets , 2003 .

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

[22]  P. Varaiya,et al.  On Verification of Controlled Hybrid Dynamics through Ellipsoidal Techniques , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

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

[24]  Vladimir M. Veliov,et al.  On the Time-Discretization of Control Systems , 1997 .