Convex computation of the maximum controlled invariant set for discrete-time polynomial control systems
Convex computation of the maximum controlled invariant set for discrete-time polynomial control systems
We characterize the maximum controlled invariant (MCI) set for discrete-time systems as the solution of an infinite-dimensional linear programming problem. In the case of systems with polynomial dynamics and semialgebraic state and control constraints, we describe a hierarchy of finite-dimensional linear matrix inequality relaxations of this problem that provides outer …