Related papers: Computer-assisted proofs for Lyapunov stability vi…
Stability analysis tools are essential to understanding and controlling any engineering system. Recently sum-of-squares (SOS) based methods have been used to compute Lyapunov based estimates for the region-of-attraction (ROA) of polynomial…
Certifying the stability of dynamical systems is a central and challenging task in control theory and systems analysis. To tackle these problems we present an algorithmic approach to finding polynomial Lyapunov functions. Our method relies…
We present a new data-driven method to provide probabilistic stability guarantees for black-box switched linear systems. By sampling a finite number of observations of trajectories, we construct approximate Lyapunov functions and deduce the…
We show that existence of a global polynomial Lyapunov function for a homogeneous polynomial vector field or a planar polynomial vector field (under a mild condition) implies existence of a polynomial Lyapunov function that is a sum of…
Recently sum-of-squares (SOS) based methods have been used for the stability analysis and control synthesis of polynomial dynamical systems. This analysis framework was also extended to non-polynomial dynamical systems, including power…
In a recent paper we have shown how to learn controllers for unknown linear systems using finite-sized noisy data by solving linear matrix inequalities. In this note we extend this approach to deal with unknown nonlinear polynomial systems…
Sum of Squares programming has been used extensively over the past decade for the stability analysis of nonlinear systems but several questions remain unanswered. In this paper, we show that exponential stability of a polynomial vector…
Reliable quasi-static object manuipulation and robotic locomotion require verification of the stability of equilibria under rigid contacts and friction. In a recent paper, M. Posa, M. Tobenkin, and R. Tedrake demonstrated that…
By computing Lyapunov functions of a certain, convenient structure, Lyapunov-based methods guarantee stability properties of the system or, when performing synthesis, of the relevant closed-loop or error dynamics. In doing so, they provide…
This article establishes the existence of Lyapunov functions for analyzing the stability of a class of state-constrained systems, and it describes algorithms for their numerical computation. The system model consists of a differential…
Computer assisted procedures of Lyapunov functions defined in given neighborhoods of fixed points for flows and maps are discussed. We provide a systematic methodology for constructing explicit ranges where quadratic Lyapunov functions…
Mathematical proofs are a cornerstone of control theory, and it is important to get them right. Deduction systems can help with this by mechanically checking the proofs. However, the structure and level of detail at which a proof is…
We consider the stability analysis of a large class of linear 1-D PDEs with polynomial data. This class of PDEs contains, as examples, parabolic and hyperbolic PDEs, PDEs with boundary feedback and systems of in-domain/boundary coupled…
We propose a novel approach to certify closed-loop stability and safety of a constrained polynomial system based on the combination of Control Lyapunov Functions (CLFs) and Control Barrier Functions (CBFs). For polynomial systems that are…
In this paper, we present a novel approach to determine the stability of switched linear and nonlinear systems using Sum of Squares optimisation. Particularly, we use Sum of Squares optimisation to search for a Lyapunov function that…
Finite-time stability (FTS) of a differential equation guarantees that solutions reach a given equilibrium point in finite time, where the time of convergence depends on the initial state of the system. For traditional stability notions…
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…
We consider numerical certification of approximate solutions to a system of polynomial equations with more equations than unknowns by first certifying solutions to a square subsystem. We give several approaches that certifiably select which…
Security assessment of large-scale, strongly nonlinear power grids containing thousands to millions of interacting components is a computationally expensive task. Targeting at reducing the computational cost, this paper introduces a…
While there has been increasing interest in using neural networks to compute Lyapunov functions, verifying that these functions satisfy the Lyapunov conditions and certifying stability regions remain challenging due to the curse of…