Convex computation of the maximum controlled invariant set for discrete-time polynomial control systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00226019" target="_blank" >RIV/68407700:21230/13:00226019 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/CDC.2013.6761016" target="_blank" >http://dx.doi.org/10.1109/CDC.2013.6761016</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/CDC.2013.6761016" target="_blank" >10.1109/CDC.2013.6761016</a>

Result language
angličtina
Original language name
Convex computation of the maximum controlled invariant set for discrete-time polynomial control systems
Original language description
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 finitedimensional 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 theapproximations are the outcome of a single semidefinite program with no additional input apart from the problem description.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 52nd IEEE Conference on Decision and Control
ISBN
978-1-4673-5717-3
ISSN
0191-2216
e-ISSN
—
Number of pages
6
Pages from-to
7107-7112
Publisher name
IEEE
Place of publication
Piscataway
Event location
Florence
Event date
Dec 10, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)