On Complexity Bounds for the Maximal Admissible Set of Linear Time-Invariant Systems
- 27 March 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (9) , 6389-6396
Abstract
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 inequalities a priori from problem data. To address this gap, this contribution presents two computationally efficient methods to obtain upper bounds on 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.Keywords
All Related Versions
Funding Information
- NASA (VT-80NSSC20M0213)
- National Institute of Standards and Technology (70NANB21H162)
- National Science Foundation (ECCS-1931738)
This publication has 20 references indexed in Scilit:
- Computation of the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraintsAutomatica, 2021
- Reference governors and maximal output admissible sets for linear periodic systemsInternational Journal of Control, 2019
- Reference and command governors for systems with constraints: A survey on theory and applicationsAutomatica, 2017
- Maximal closed loop admissible set for linear systems with non-convex polyhedral constraintsJournal of Process Control, 2011
- Exact determinations of the maximal output admissible set for a class of nonlinear systemsAutomatica, 2008
- Set-Theoretic Methods in Control2008
- Convex Optimization2004
- Set invariance in controlAutomatica, 1999
- Discrete‐time reference governors and the nonlinear control of systems with state and control constraintsInternational Journal of Robust and Nonlinear Control, 1995
- Functional models in linear algebraLinear Algebra and its Applications, 1992