On maximal positive invariant set computation for rank-deficient linear systems
This addresses a technical limitation in control theory for systems with singular dynamics, though it appears incremental as it extends existing methods to a specific case.
The paper tackles the problem of computing maximal positively invariant sets for rank-deficient linear systems, which arise when closed-loop eigenvalues are at zero, by proposing a robust algorithm using Schur decomposition that handles both polyhedral and constrained-zonotope representations.
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.