Squaring the circle : an algorithm for generating polyhedral invariant sets from ellipsoidal ones

A. Alessio, M. Lazar, A. Bemporad, W.P.M.H. Heemels

Research output: Contribution to journalArticleAcademicpeer-review

19 Citations (Scopus)

Abstract

This paper presents a new (geometrical) approach to the computation of polyhedral positively invariant 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 positively invariant (and contractive under an additional assumption) is given, and a new algorithm is developed to construct the desired polyhedral set. An advantage of the proposed method is that 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 thecomputation of polyhedral terminal constraint sets for model predictive control based on quadratic costs.
Original languageEnglish
Pages (from-to)2096-2103
Number of pages8
JournalAutomatica
Volume43
Issue number12
DOIs
Publication statusPublished - 2007

Fingerprint

Quadratic programming
Model predictive control
Costs

Cite this

@article{3b4d527fcd7c4c71ab74d49379587fc2,
title = "Squaring the circle : an algorithm for generating polyhedral invariant sets from ellipsoidal ones",
abstract = "This paper presents a new (geometrical) approach to the computation of polyhedral positively invariant 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 positively invariant (and contractive under an additional assumption) is given, and a new algorithm is developed to construct the desired polyhedral set. An advantage of the proposed method is that 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 thecomputation of polyhedral terminal constraint sets for model predictive control based on quadratic costs.",
author = "A. Alessio and M. Lazar and A. Bemporad and W.P.M.H. Heemels",
year = "2007",
doi = "10.1016/j.automatica.2007.04.028",
language = "English",
volume = "43",
pages = "2096--2103",
journal = "Automatica",
issn = "0005-1098",
publisher = "Agon Elsevier",
number = "12",

}

Squaring the circle : an algorithm for generating polyhedral invariant sets from ellipsoidal ones. / Alessio, A.; Lazar, M.; Bemporad, A.; Heemels, W.P.M.H.

In: Automatica, Vol. 43, No. 12, 2007, p. 2096-2103.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Squaring the circle : an algorithm for generating polyhedral invariant sets from ellipsoidal ones

AU - Alessio, A.

AU - Lazar, M.

AU - Bemporad, A.

AU - Heemels, W.P.M.H.

PY - 2007

Y1 - 2007

N2 - This paper presents a new (geometrical) approach to the computation of polyhedral positively invariant 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 positively invariant (and contractive under an additional assumption) is given, and a new algorithm is developed to construct the desired polyhedral set. An advantage of the proposed method is that 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 thecomputation of polyhedral terminal constraint sets for model predictive control based on quadratic costs.

AB - This paper presents a new (geometrical) approach to the computation of polyhedral positively invariant 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 positively invariant (and contractive under an additional assumption) is given, and a new algorithm is developed to construct the desired polyhedral set. An advantage of the proposed method is that 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 thecomputation of polyhedral terminal constraint sets for model predictive control based on quadratic costs.

U2 - 10.1016/j.automatica.2007.04.028

DO - 10.1016/j.automatica.2007.04.028

M3 - Article

VL - 43

SP - 2096

EP - 2103

JO - Automatica

JF - Automatica

SN - 0005-1098

IS - 12

ER -