Nonlinear systems analysis (2nd ed.)
Nonlinear systems analysis (2nd ed.)
Paper: Maximal lyapunov functions and domains of attraction for autonomous nonlinear systems
Automatica (Journal of IFAC)
A computational method for determining quadratic lyapunov functions for non-linear systems
Automatica (Journal of IFAC)
Randomized Algorithms for Analysis and Control of Uncertain Systems: With Applications
Randomized Algorithms for Analysis and Control of Uncertain Systems: With Applications
Local robust performance analysis for nonlinear dynamical systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Linearized analysis versus optimization-based nonlinear analysis for nonlinear systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
International Journal of Robotics Research
Analysis of autocatalytic networks in biology
Automatica (Journal of IFAC)
Verification of Periodically Controlled Hybrid Systems: Application to an Autonomous Vehicle
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
Generalised absolute stability and sum of squares
Automatica (Journal of IFAC)
Lyapunov analysis of rigid body systems with impacts and friction via sums-of-squares
Proceedings of the 16th international conference on Hybrid systems: computation and control
Information Sciences: an International Journal
Hi-index | 22.15 |
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.