The Maximal Robust Positively Invariant Set for Linear Difference Inclusions
Abstract
This article develops a systematic characterization and exact computational framework for the maximal robust positively invariant set of linear difference inclusions. The maximal set is characterized as the greatest fixed point of the robust predecessor operator, leading to three equivalent set iterations for its computation. Under uniform exponential stability and bounded disturbances, the Kuratowski upper limit of the disturbance-reachable sets yields a necessary and sufficient condition for the maximal set to be nonempty under closed state constraints. Sufficient conditions for its finite determination are also established, together with an explicit bound on the determination index. For polyhedral state constraints, bounded disturbances, and finite or polytopic matrix families, exact half-space implementations of the three iterations are derived. Although these algorithms generate the same set sequence, complexity analysis and numerical experiments reveal substantial differences in their computational performance.
Related
- Maximal Monotone Differential Inclusions with Volterra and One-Sided Lipschitz Perturbations under Nonlocal Initial Conditions and Applications
- Modeling soliton-potential interactions for the 1-D cubic NLS via an invariant-preserving finite-difference method
- On a finite group in which every non-nilpotent maximal invariant subgroup of order divisible by p is normal
- Invariant almost Hermitian structures on the maximal real flag manifold of type π3
- Persistence of bounded trajectories in positively transverse reaction networks
BibTeX
@misc{wang2026maximal,
title = {{The Maximal Robust Positively Invariant Set for Linear Difference Inclusions}},
author = {Kai Wang and Daniel Axehill},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2609.39499},
eprint = {2609.39499},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39499},
}
RIS
TY - UNPB
TI - The Maximal Robust Positively Invariant Set for Linear Difference Inclusions
AU - Kai Wang
AU - Daniel Axehill
PY - 2026
DA - 2026/10/22
PB - arXiv
DO - 10.48550/arxiv.2609.39499
UR - https://arxiv.org/abs/2609.39499
AB - This article develops a systematic characterization and exact computational framework for the maximal robust positively invariant set of linear difference inclusions. The maximal set is characterized as the greatest fixed point of the robust predecessor operator, leading to three equivalent set iterations for its computation. Under uniform exponential stability and bounded disturbances, the Kuratowski upper limit of the disturbance-reachable sets yields a necessary and sufficient condition for the maximal set to be nonempty under closed state constraints. Sufficient conditions for its finite determination are also established, together with an explicit bound on the determination index. For polyhedral state constraints, bounded disturbances, and finite or polytopic matrix families, exact half-space implementations of the three iterations are derived. Although these algorithms generate the same set sequence, complexity analysis and numerical experiments reveal substantial differences in their computational performance.
ER -