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 approximations with guaranteed set-wise convergence to the MCI set. The approach is compact and readily applicable in the sense that the approximations are the outcome of a single semidefinite program with no additional input apart from the problem description.


Presented at:
IEEE Conference on Decision and Control, Florence, Italy, December 10-13, 2013
Year:
2013
Laboratories:




 Record created 2014-03-20, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)