A novel approach to the computation of polyhedral invariant sets for constrained systems
This paper presents two algorithms for the computation of polyhedral positively invariant sets for constrained discrete-time certain and uncertain linear systems, extended from [11]. The approach is based on the novel use of auxiliary constant state feedback laws that give distinct, stable, real-val...
Saved in:
Published in | 2016 IEEE Conference on Computer Aided Control System Design (CACSD) pp. 1428 - 1433 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.09.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper presents two algorithms for the computation of polyhedral positively invariant sets for constrained discrete-time certain and uncertain linear systems, extended from [11]. The approach is based on the novel use of auxiliary constant state feedback laws that give distinct, stable, real-valued closed loop eigenvalues. The algorithms are simple and non-iterative, and include only linear programming (LP). Illustrative examples show the benefits of the new approach. |
---|---|
ISSN: | 2165-302X |
DOI: | 10.1109/CACSD.2016.7602556 |