The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterized as sublevel sets of Lyapunov functions. Finite-dimensional polynomial parametrizations for Lyapunov functions are used. A methodology utilizing information from simulations to generate Lyapunov function candidates satisfying necessary conditions for bilinear constraints is proposed. The suitability of Lyapunov function candidates is assessed solving linear sum-of-squares optimization problems. Qualified candidates are used to compute invariant subsets of the region-of-attraction and to initialize various bilinear search strategies for further optimization. We illustrate the method on small examples from the literature and several control oriented systems.
Bibliographical noteFunding Information:
This work was sponsored by the Air Force Office of Scientific Research, USAF, under grant/contract number FA9550-05-1-0266. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the AFOSR or the US Government.
- Local stability
- Nonlinear dynamics
- Sum-of-squares programming