Stability and Robustness Analysis of Nonlinear Systems via Contraction Metrics and SOS Programming

Abstract

Contraction analysis is a stability theory for nonlinear systems where stability is defined incrementally between two arbitrary trajectories. It provides an alternative framework in which to study uncertain interconnections or systems with external inputs, where it offers several significant advantages when compared with traditional Lyapunov analysis. Contraction-based methods are particularly useful for analyzing systems with uncertain parameters and for proving synchronization properties of nonlinear oscillators. Existence of a contraction metric for a given system is a necessary and sufficient condition for global exponential convergence of system trajectories. For systems with polynomial or rational dynamics, the search for contraction metrics can be made fully algorithmic through the use of convex optimization and sum of squares (SOS) programming. The search process is made computationally tractable by relaxing matrix definiteness constraints, whose feasibility indicate existence of a contraction metric, into SOS constraints on polynomial matrices. We illustrate the results through examples from the literature, emphasizing the advantages and contrasting the differences between the contraction approach and traditional Lyapunov techniques.

25 pages, submitted

References in corpus (1)

• Symmetry groups, semidefinite programs, and sums of squares

Cited by in corpus (23)

• Contraction Theory for Nonlinear Stability Analysis and Learning-based Control: A Tutorial Overview
• Neural Contraction Metrics for Robust Estimation and Control: A Convex Optimization Approach
• Robust Controller Design for Stochastic Nonlinear Systems via Convex Optimization
• Beyond Convexity -- Contraction and Global Convergence of Gradient Descent
• Algebraic Relaxations and Hardness Results in Polynomial Optimization and Lyapunov Analysis
• Performance enhancements for a generic conic interior point algorithm
• Learning Contracting Vector Fields For Stable Imitation Learning
• Learning Certified Control using Contraction Metric
• Stability of Polynomial Differential Equations: Complexity and Converse Lyapunov Questions
• Control Contraction Metrics, Robust Control and Observer Duality
• Axiomatization of Compact Initial Value Problems: Open Properties
• Online Robust Control of Nonlinear Systems with Large Uncertainty
• $k$-Contraction in a Generalized Lurie System
• Robust Model Predictive Control for Nonlinear Systems Using Convex Restriction
• Robust Contraction Analysis of Nonlinear Systems via Differential IQC
• Finding positively invariant sets and proving exponential stability of limit cycles using Sum-of-Squares decompositions
• Contraction based stabilization of nonlinear singularly perturbed systems and application to high gain feedback
• Kernel-based Discretisation for Solving Matrix-Valued PDEs
• A Contraction Theory Approach for Analysis of Performance Recovery in Dynamic Surface Control
• Exact Safety Verification of Interval Hybrid Systems Based on Symbolic-Numeric Computation
• Generation of bounded invariants via stroboscopic set-valued maps: Application to the stability analysis of parametric time-periodic systems
• Construction of a CPA contraction metric for periodic orbits using semidefinite optimization
• Nonlinear Stabilization via Control Contraction Metrics: a Pseudospectral Approach for Computing Geodesics