On Complexity Bounds for the Maximal Admissible Set of Linear Time-Invariant Systems
Hamid R. Ossareh, Ilya V. Kolmanovsky · IEEE Transactions on Automatic Control · 2024
Given a dynamical system with constrained outputs, the maximal admissible set (MAS) is defined as the set of all initial conditions such that the output constraints are satisfied for all time. It has been previously shown that for discrete-time, linear, time-invariant, stable, observable systems with polytopic constraints, this set is a polytope described by a finite number of inequalities (i.e., has finite complexity). However, it is not possible to know the number of inequalitiesa priorifrom problem data. To address this gap, this contribution presents two computationally efficient methods to obtainupper boundson the complexity of the MAS. The first method is algebraic and is based on matrix power series, while the second is geometric and is based on Lyapunov analysis. The two methods are rigorously introduced, a detailed numerical comparison between the two is provided, and an extension to systems with constant inputs is presented.