Convex Computation of the Region of Attraction of Polynomial Control Systems

Didier Henrion, Milan Korda

IEEE Transactions on Automatic Control · 2013 · 312 citations · 25 references

DOIFull text

Open access

Concepts

TL;DR

Existing methods for computing the region of attraction rely on dual Lyapunov approaches that yield nonconvex bilinear matrix inequalities or conservative LMI conditions. The study aims to compute the region of attraction for polynomial control systems with semialgebraic state and input constraints. The authors formulate an infinite‑dimensional convex linear program over measures and approximate it with a converging hierarchy of linear matrix inequalities, producing semialgebraic outer approximations of the ROA via a single semidefinite program. The method is validated on multiple numerical examples, confirming that the ROA can be computed through the proposed convex LP and LMI hierarchy.

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. The approach is demonstrated on several numerical examples.

References

25