Convex computation of the region of attraction of polynomial control systems

Didier Henrion 1 Milan Korda 2
1 LAAS-MAC - Équipe Méthodes et Algorithmes en Commande
LAAS - Laboratoire d'analyse et d'architecture des systèmes
2 Laboratoire dÁutomatique
EPFL - Ecole Polytechnique Fédérale de Lausanne
Abstract : We address the long-standing problem of computing the region of attraction (ROA) of a target set (e.g., a neighborhood of an equilibrium point) of a controlled nonlinear system with polynomial dynamics and semialgebraic state and input constraints. We show that the ROA can be computed by solving an infinite-dimensional convex linear programming (LP) problem over the space of measures. In turn, this problem can be solved approximately via a classical converging hierarchy of convex finite-dimensional linear matrix inequalities (LMIs). Our approach is genuinely primal in the sense that convexity of the problem of computing the ROA is an outcome of optimizing directly over system trajectories. The dual infinite-dimensional LP on nonnegative continuous functions (approximated by polynomial sum-of-squares) allows us to generate a hierarchy of semialgebraic outer approximations of the ROA at the price of solving a sequence of LMI problems with asymptotically vanishing conservatism. This sharply contrasts with the existing literature which follows an exclusively dual Lyapunov approach yielding either nonconvex bilinear matrix inequalities or conservative LMI conditions. The approach is simple and readily applicable as the outer approximations are the outcome of a single semidefinite program with no additional data required besides the problem description.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00723019
Contributor : Didier Henrion <>
Submitted on : Thursday, November 28, 2013 - 3:17:00 PM
Last modification on : Friday, January 10, 2020 - 9:10:07 PM
Long-term archiving on: Saturday, April 8, 2017 - 2:51:00 AM

Files

roa.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00723019, version 2
  • ARXIV : 1208.1751

Citation

Didier Henrion, Milan Korda. Convex computation of the region of attraction of polynomial control systems. IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, 2014, 59 (2), pp. 297-312. ⟨hal-00723019v2⟩

Share

Metrics

Record views

498

Files downloads

318