Optimal switching control design for polynomial systems: an LMI approach

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00798196
Contributor : Didier Henrion <>
Submitted on : Friday, March 8, 2013 - 10:42:12 AM
Last modification on : Friday, January 10, 2020 - 9:10:08 PM
Long-term archiving on: Sunday, April 2, 2017 - 10:18:54 AM

Files

switch.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00798196, version 1
  • ARXIV : 1303.1988

Citation

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⟩

Share

Metrics

Record views

467

Files downloads

256