Optimal switching control design for polynomial systems: an LMI approach - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Optimal switching control design for polynomial systems: an LMI approach

Résumé

We propose a new LMI approach to the design of optimal switching sequences for polynomial dynamical systems with state constraints. We formulate the switching design problem as an optimal control problem which is then relaxed to a linear programming (LP) problem in the space of occupation measures. This infinite-dimensional LP can be solved numerically and approximately with a hierarchy of convex finite-dimensional LMIs. In contrast with most of the existing work on LMI methods, we have a guarantee of global optimality, in the sense that we obtain an asympotically converging (i.e. with vanishing conservatism) hierarchy of lower bounds on the achievable performance. We also explain how to construct an almost optimal switching sequence.
Fichier principal
Vignette du fichier
switch.pdf (269.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00798196 , version 1 (08-03-2013)

Identifiants

Citer

Didier Henrion, Jamal Daafouz, Mathieu Claeys. Optimal switching control design for polynomial systems: an LMI approach. 52nd IEEE Conference on Decision and Control, CDC 2013, Dec 2013, Florence, Italy. CDROM, pp. 1349-1354. ⟨hal-00798196⟩
237 Consultations
170 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More