This paper shows how interval arithmetic can be applied to the computation of control invariant sets. The paper reviews some concepts in invariant set theory and presents recursive algorithms to compute sequences of control invariant sets. These ideas can be used to design stable controllers subject to state and control constraints. To prove set inclusion and inversion, interval arithmetic is also used.
展开▼
