Abstract
Lyapunov functions provide a tool to analyze the stability of nonlinear systems without extensively solving the dynamics. Recent advances in sum-of-squares methods have enabled the algorithmic computation of Lyapunov functions for polynomial systems. However, for general large-scale nonlinear networks it is yet very difficult, and often impossible, both computationally and analytically, to find Lyapunov functions. In such cases, a system decomposition coupled to a vector Lyapunov functions approach provides a feasible alternative by analyzing the stability of the nonlinear network through a reduced-order comparison system. However, finding such a comparison system is not trivial and often, for a nonlinear network, there does not exist a single comparison system. In this work, we propose a multiple comparison systems approach for the algorithmic stability analysis of nonlinear systems. Using sum-of-squares methods we design a scalable and distributed algorithm which enables the computation of comparison systems using only communications between the neighboring subsystems. We demonstrate the algorithm by applying it to an arbitrarily generated network of interacting Van der Pol oscillators.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.