Computation of Polyhedral Positive Invariant Sets via Linear Matrix Inequalities

Daniel Rubin, Hoai Nam Nguyen, Per Olof Gutman

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

Abstract

This paper presents a linear matrix inequality based algorithm for computation of polyhedral positive invari- ant sets for linear discrete-time systems subject to bounded state and input constraints. While the main algorithm is suitable for computation of polyhedral invariant sets of a general shape, a second algorithm specialized for symmetric sets is also presented. The results are extended to include polytopic uncertainty. Verification and demonstration of the proposed scheme is done through numerical examples.

Original languageEnglish
Title of host publication2018 European Control Conference, ECC 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2941-2946
Number of pages6
ISBN (Electronic)9783952426982
DOIs
Publication statusPublished - 27 Nov 2018
Externally publishedYes
Event16th European Control Conference, ECC 2018 - Limassol, Cyprus
Duration: 12 Jun 201815 Jun 2018

Publication series

Name2018 European Control Conference, ECC 2018

Conference

Conference16th European Control Conference, ECC 2018
Country/TerritoryCyprus
CityLimassol
Period12/06/1815/06/18

Fingerprint

Dive into the research topics of 'Computation of Polyhedral Positive Invariant Sets via Linear Matrix Inequalities'. Together they form a unique fingerprint.

Cite this