On Maximal Positive Invariant Set Computation for Rank-Deficient Linear Systems
- 15 June 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 961-966
Abstract
The maximal positively invariant (MPI) set is obtained through a backward reachability procedure involving the iterative computation and intersection of predecessor sets under state and input constraints. However, standard static feedback synthesis may place some of the closed-loop eigenvalues at zero, leading to rank-deficient dynamics. This affects the MPI computation by inducing projections onto lower-dimensional subspaces during intermediate steps. By exploiting the Schur decomposition, we explicitly address this singular case and propose a robust algorithm that computes the MPI set in both polyhedral and constrained-zonotope representations.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Polyhedral control design: Theory and methodsAnnual Reviews in Control, 2025
- A set-theoretic generalization of dissipativity with applications in Tube MPCAutomatica, 2020
- Vertical hierarchical MPC for constrained linear systemsAutomatica, 2020
- CasADi: a software framework for nonlinear optimization and optimal controlMathematical Programming Computation, 2018
- Constrained zonotopes: A new tool for set-based estimation and fault detectionAutomatica, 2016
- Set-Theoretic Methods in Control2008
- Matlab code for sorting real Schur formsNumerical Linear Algebra with Applications, 2002
- Lectures on 0/1-Polytopes2000
- Deadbeat control: A special inverse eigenvalue problemBIT Numerical Mathematics, 1984
- Construction of a canonic basis for matrices and pencils of matricesJournal of Mathematical Sciences, 1982