This is the authors' abstract. We don't add key points for this paper.
The maximal admissible set (MAS) of a dynamical system characterizes the set of all initial conditions and constant inputs for which the ensuing response satisfies the specified state/output constraints for all time. For a discrete-time, linear time-invariant (LTI) system subject to polytopic constraints and unknown bounded disturbances, the MAS is known to be a polytope, which may not be finitely determined (i.e., it may not be defined by a finite number of inequalities). Thus, the steady-state constraint is usually tightened, which results in a finitely-determined inner approximation of the MAS. However, the complexity of this approximation is not known a priori from problem data. This paper presents and compares two computationally efficient methods, based on matrix power series and on quadratic ISS-Lyapunov functions, respectively, to upper bound the complexity of the MAS. The bounds may facilitate the online computation of the MAS and the implementation of robust reference governors and model predictive controllers.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Ossareh et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: