Brief paper: Squaring the circle: An algorithm for generating polyhedral invariant sets from ellipsoidal ones

  • Authors:

  • A. Alessio;M. Lazar;A. Bemporad;W. P. M. H. Heemels

  • Affiliations:

  • Dip. Ingegneria dell'Informazione, Universita di Siena, Via Roma 56, 53100 Siena, Italy;Department of Electrical Engineering, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Dip. Ingegneria dell'Informazione, Universita di Siena, Via Roma 56, 53100 Siena, Italy;Department of Mechanical Engineering, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands and Embedded Systems Institute, Eindhoven, The Netherlands

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 2007

Quantified Score

Hi-index 22.15

Visualization

Abstract

This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete-time systems possibly affected by disturbances. Given a @b-contractive ellipsoidal set E, the key idea is to construct a polyhedral set that lies between the ellipsoidal sets @bE and E. A proof that the resulting polyhedral set is contractive and thus, PI, is given, and a new algorithm is developed to construct the desired polyhedral set. The problem of computing polyhedral invariant sets is formulated as a number of quadratic programming (QP) problems. The number of QP problems is guaranteed to be finite and therefore, the algorithm has finite termination. An important application of the proposed algorithm is the computation of polyhedral terminal constraint sets for model predictive control based on quadratic costs.