# Computing Robust Controlled Invariant Sets of Linear Systems

arXiv: https://arxiv.org/abs/1601.00416 · HTML: https://mlsanity.com/paper/1601.00416/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 4 Jan 2016.

## Built on by (most cited first, 5 of 5)

- [LTL-Constrained Steady-State Policy Synthesis](https://mlsanity.com/paper/2105.14894/) (2021)
- [Fail-Safe Adversarial Generative Imitation Learning](https://mlsanity.com/paper/2203.01696/) (2022)
- [Control invariant set enhanced safe reinforcement learning: improved sampling efficiency, guaranteed stability and robustness](https://mlsanity.com/paper/2305.15602/) (2023)
- [Control invariant set enhanced reinforcement learning for process control: improved sampling efficiency and guaranteed stability](https://mlsanity.com/paper/2304.05509/) (2023)
- [SIT-LMPC: Safe Information-Theoretic Learning Model Predictive Control for Iterative Tasks](https://mlsanity.com/paper/2602.16187/) (2026)

## Abstract (arXiv)

We consider controllable linear discrete-time systems with bounded perturbations and present two methods to compute robust controlled invariant sets. The first method tolerates an arbitrarily small constraint violation to compute an arbitrarily precise outer approximation of the maximal robust controlled invariant set, while the second method provides an inner approximation. The outer approximation scheme is δ-complete, given that the constraint sets are formulated as finite unions of polytopes.