Computation and verification of contraction metrics for exponentially stable equilibria

The determination of exponentially stable equilibria and their basin of attraction for a dynamical system given by a general autonomous ordinary differential equation can be achieved by means of a contraction metric. A contraction metric is a Riemannian metric with respect to which the distance between adjacent solutions decreases as time increases. The Riemannian metric can be expressed by a matrix-valued function on the phase space. The determination of a contraction metric can be achieved by approximately solving a matrix-valued partial differential equation by mesh-free collocation using Radial Basis Functions (RBF). However, so far no rigorous verification that the computed metric is indeed a contraction metric has been provided. In this paper, we combine the RBF method to compute a contraction metric with the CPA method to rigorously verify it. In particular, the computed contraction metric is interpolated by a continuous piecewise affine (CPA) metric at the vertices of a fixed triangulation, and by checking finitely many inequalities, we can verify that the interpolation is a contraction metric. Moreover, we show that, using sufficiently dense collocation points and a sufficiently fine triangulation, we always succeed with the construction and verification. We apply the method to two examples

Review on computational methods for Lyapunov functions

Lyapunov functions are an essential tool in the stability analysis of dynamical systems, both in theory and applications. They provide sufficient conditions for the stability of equilibria or more general invariant sets, as well as for their basin of attraction. The necessity, i.e. the existence of Lyapunov functions, has been studied in converse theorems, however, they do not provide a general method to compute them. Because of their importance in stability analysis, numerous computational construction methods have been developed within the Engineering, Informatics, and Mathematics community. They cover different types of systems such as ordinary differential equations, switched systems, non-smooth systems, discrete-time systems etc., and employ di_erent methods such as series expansion, linear programming, linear matrix inequalities, collocation methods, algebraic methods, set-theoretic methods, and many others. This review brings these different methods together. First, the different types of systems, where Lyapunov functions are used, are briefly discussed. In the main part, the computational methods are presented, ordered by the type of method used to construct a Lyapunov function

Review on contraction analysis and computation of contraction metrics

Contraction analysis considers the distance between two adjacent trajectories. If this distance is contracting, then trajectories have the same long-term behavior. The main advantage of this analysis is that it is independent of the solutions under consideration. Using an appropriate metric, with respect to which the distance is contracting, one can show convergence to a unique equilibrium or, if attraction only occurs in certain directions, to a periodic orbit. Contraction analysis was originally considered for ordinary differential equations, but has been extended to discrete-time systems, control systems, delay equations and many other types of systems. Moreover, similar techniques can be applied for the estimation of the dimension of attractors and for the estimation of different notions of entropy (including topological entropy). This review attempts to link the references in both the mathematical and the engineering literature and, furthermore, point out the recent developments and algorithms in the computation of contraction metrics

Frequency conditions for the global stability of nonlinear delay equations with several equilibria

In our adjacent work, we developed a spectral comparison principle for compound cocycles generated by delay equations. In particular, this principle allows to derive frequency conditions (inequalities) for the uniform exponential stability of such cocycles by means of their comparison with stationary problems. Such inequalities are hard to verify analytically since they contain resolvents of additive compound operators and to compute the resolvents it is required solving a first-order PDEs with boundary conditions involving both partial derivatives and delays. In this work, we develop approximation schemes to verify some of the arising frequency inequalities. Beside some general results, we mainly stick to the case of scalar equations. By means of the Suarez-Schopf delayed oscillator and the Mackey-Glass equations, we demonstrate applications of the theory to reveal regions in the space of parameters where the absence of closed invariant contours can be guaranteed. Since our conditions are robust, so close systems also satisfy them, we expect them to actually imply the global stability, as in known finite-dimensional results utilizing variants of the Closing Lemma which is still awaiting developments in infinite dimensions

Contraction analysis of nonlinear systems and its application

The thesis addresses various issues concerning the convergence properties of switched systems and differential algebraic equation (DAE) systems. Specifically, we focus on contraction analysis problem, as well as tackling problems related to stabilization and synchronization. We consider the contraction analysis of switched systems and DAE systems. To address this, a transformation is employed to convert the contraction analysis problem into a stabilization analysis problem. This transformation involves the introduction of virtual systems, which exhibit a strong connection with the Jacobian matrix of the vector field. Analyzing these systems poses a significant challenge due to the distinctive structure of their Jacobian matrices. Regarding the switched systems, a time-dependent switching law is established to guarantee uniform global exponential stability (UGES). As for the DAE system, we begin by embedding it into an ODE system. Subsequently, the UGES property is ensured by analyzing its matrix measure. As our first application, we utilize our approach to stabilize time-invariant switched systems and time-invariant DAE systems, respectively. This involves designing control laws to achieve system contractivity, thereby ensuring that the trajectory set encompasses the equilibrium point. In oursecond application, we propose the design of a time-varying observer by treating the system’s output as an algebraic equation of the DAE system. In our study on synchronization problems, we investigate two types of synchronization issues: the trajectory tracking of switched oscillators and the pinning state synchronization. In the case of switched oscillators, we devise a time-dependent switching law to ensure that these oscillators effectively follow the trajectory of a time-varying system. As for the pinning synchronization problem, we define solvable conditions and, building upon these conditions, we utilize contraction theory to design dynamic controllers that guarantee synchronization is achieved among the agents

Contraction analysis of nonlinear systems and its application

The thesis addresses various issues concerning the convergence properties of switched systems and differential algebraic equation (DAE) systems. Specifically, we focus on contraction analysis problem, as well as tackling problems related to stabilization and synchronization. We consider the contraction analysis of switched systems and DAE systems. To address this, a transformation is employed to convert the contraction analysis problem into a stabilization analysis problem. This transformation involves the introduction of virtual systems, which exhibit a strong connection with the Jacobian matrix of the vector field. Analyzing these systems poses a significant challenge due to the distinctive structure of their Jacobian matrices. Regarding the switched systems, a time-dependent switching law is established to guarantee uniform global exponential stability (UGES). As for the DAE system, we begin by embedding it into an ODE system. Subsequently, the UGES property is ensured by analyzing its matrix measure. As our first application, we utilize our approach to stabilize time-invariant switched systems and time-invariant DAE systems, respectively. This involves designing control laws to achieve system contractivity, thereby ensuring that the trajectory set encompasses the equilibrium point. In oursecond application, we propose the design of a time-varying observer by treating the system’s output as an algebraic equation of the DAE system. In our study on synchronization problems, we investigate two types of synchronization issues: the trajectory tracking of switched oscillators and the pinning state synchronization. In the case of switched oscillators, we devise a time-dependent switching law to ensure that these oscillators effectively follow the trajectory of a time-varying system. As for the pinning synchronization problem, we define solvable conditions and, building upon these conditions, we utilize contraction theory to design dynamic controllers that guarantee synchronization is achieved among the agents

Optimization-based Framework for Stability and Robustness of Bipedal Walking Robots

As robots become more sophisticated and move out of the laboratory, they need to be able to reliably traverse difficult and rugged environments. Legged robots -- as inspired by nature -- are most suitable for navigating through terrain too rough or irregular for wheels. However, control design and stability analysis is inherently difficult since their dynamics are highly nonlinear, hybrid (mixing continuous dynamics with discrete impact events), and the target motion is a limit cycle (or more complex trajectory), rather than an equilibrium. For such walkers, stability and robustness analysis of even stable walking on flat ground is difficult. This thesis proposes new theoretical methods to analyse the stability and robustness of periodic walking motions. The methods are implemented as a series of pointwise linear matrix inequalities (LMI), enabling the use of convex optimization tools such as sum-of-squares programming in verifying the stability and robustness of the walker. To ensure computational tractability of the resulting optimization program, construction of a novel reduced coordinate system is proposed and implemented. To validate theoretic and algorithmic developments in this thesis, a custom-built “Compass gait” walking robot is used to demonstrate the efficacy of the proposed methods. The hardware setup, system identification and walking controller are discussed. Using the proposed analysis tools, the stability property of the hardware walker was successfully verified, which corroborated with the computational results