On the computation of convex robust control invariant sets for nonlinear systems

In this paper we provide a method to compute robust control invariant sets for nonlinear discrete-time systems. A simple criterion to evaluate if a convex set in state space is a robust control invariant set for a nonlinear uncertain system is presented. The criterion is employed to design an algorithm for computing a polytopic robust control invariant set. The method is based on the properties of DC functions, i.e. functions which can be expressed as the difference of two convex functions. Since the elements of a wide class of nonlinear functions have DC representation or, at least, admit an arbitrarily close approximation, the method is quite general. The algorithm requires relatively low computational resources.

[1]  Franco Blanchini,et al.  Set-theoretic methods in control , 2007 .

[2]  B. Kouvaritakis,et al.  Nonlinear model predictive control with polytopic invariant sets , 2002 .

[3]  Basil Kouvaritakis,et al.  Nonlinear model predictive control with polytopic invariant sets , 2003, Autom..

[4]  Christodoulos A. Floudas,et al.  Rigorous convex underestimators for general twice-differentiable problems , 1996, J. Glob. Optim..

[5]  Marko Bacic,et al.  Model predictive control , 2003 .

[6]  Franco Blanchini,et al.  Set invariance in control , 1999, Autom..

[7]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[8]  T. Alamo,et al.  A set-membership state estimation algorithm based on DC programming , 2008, Autom..

[9]  G. Chesi.  Homogeneous Polynomial Forms for Robustness Analysis of Uncertain Systems , 2009 .

[10]  John O'Reilly,et al.  Optimisation of attraction domains of nonlinear MPC via LMI methods , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[11]  Eduardo F. Camacho,et al.  On the computation of invariant sets for constrained nonlinear systems: An interval arithmetic approach , 2003, ECC.

[12]  E. Gilbert,et al.  Theory and computation of disturbance invariant sets for discrete-time linear systems , 1998 .

[13]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[14]  David Q. Mayne,et al.  Invariant approximations of the minimal robust positively Invariant set , 2005, IEEE Transactions on Automatic Control.

[15]  Sophie Tarbouriech,et al.  Polyhedral regions of local stability for linear discrete-time systems with saturating controls , 1999, IEEE Trans. Autom. Control..

[16]  Eduardo F. Camacho,et al.  On the computation of local invariant sets for nonlinear systems , 2007, 2007 46th IEEE Conference on Decision and Control.

[17]  K. T. Tan,et al.  Linear systems with state and control constraints: the theory and application of maximal output admissible sets , 1991 .

[18]  R. Horst,et al.  DC Programming: Overview , 1999 .

[19]  T. Alamo,et al.  Convex invariant sets for discrete-time Lur'e systems , 2009, Autom..

[20]  F. Blanchini.  Ultimate boundedness control for uncertain discrete-time systems via set-induced Lyapunov functions , 1994, IEEE Trans. Autom. Control..

[21]  R. Schneider.  Convex Bodies: The Brunn–Minkowski Theory: Minkowski addition , 1993 .