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

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


This paper presents a new (geometrical) approach to the computation of polyhedral positively invariant sets for general (possibly discontinuous) nonlinear systems, possibly affected by disturbances. Given a beta-contractive ellipsoidal set E, the key idea is to construct a polyhedral set that lies between the ellipsoidal sets betaE 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 the computation of polyhedral terminal constraint sets for model predictive control based on quadratic costs
Original languageEnglish
Title of host publicationProceedings of the 25th American Control Conference(ACC2006), 14-16 June 2006, Minneapolis, Minnesota, USA
Place of PublicationMinneapolis, Minnesota, USA
ISBN (Print)1-4244-0210-7
Publication statusPublished - 2006


Dive into the research topics of 'Squaring the circle : an algorithm for obtaining polyhedral invariant sets from ellipsoidal ones'. Together they form a unique fingerprint.

Cite this