Robust Stability of Switched Delay Systems with Average Dwell Time under Asynchronous Switching

The problem of robust stability of switched delay systems with average dwell time under asynchronous switching is investigated. By taking advantage of the average dwell-time method and an integral inequality, two sufficient conditions are developed to guarantee the global exponential stability of the considered switched system. Finally, a numerical example is provided to demonstrate the effectiveness and feasibility of the proposed techniques

Finite-Time Stability Analysis of Switched Genetic Regulatory Networks

This paper investigates the finite-time stability problem of switching genetic regulatory networks (GRNs) with interval time-varying delays and unbounded continuous distributed delays. Based on the piecewise Lyapunov-Krasovskii functional and the average dwell time method, some new finite-time stability criteria are obtained in the form of linear matrix inequalities (LMIs), which are easy to be confirmed by the Matlab toolbox. The finite-time stability is taken into account in switching genetic regulatory networks for the first time and the average dwell time of the switching signal is obtained. Two numerical examples are presented to illustrate the effectiveness of our results

Invariance principles for switched systems with restrictions

In this paper we consider switched nonlinear systems under average dwell time switching signals, with an otherwise arbitrary compact index set and with additional constraints in the switchings. We present invariance principles for these systems and derive by using observability-like notions some convergence and asymptotic stability criteria. These results enable us to analyze the stability of solutions of switched systems with both state-dependent constrained switching and switching whose logic has memory, i.e., the active subsystem only can switch to a prescribed subset of subsystems.Comment: 29 pages, 2 Appendixe

Linear Programming based Lower Bounds on Average Dwell-Time via Multiple Lyapunov Functions

With the objective of developing computational methods for stability analysis of switched systems, we consider the problem of finding the minimal lower bounds on average dwell-time that guarantee global asymptotic stability of the origin. Analytical results in the literature quantifying such lower bounds assume existence of multiple Lyapunov functions that satisfy some inequalities. For our purposes, we formulate an optimization problem that searches for the optimal value of the parameters in those inequalities and includes the computation of the associated Lyapunov functions. In its generality, the problem is nonconvex and difficult to solve numerically, so we fix some parameters which results in a linear program (LP). For linear vector fields described by Hurwitz matrices, we prove that such programs are feasible and the resulting solution provides a lower bound on the average dwell-time for exponential stability. Through some experiments, we compare our results with the bounds obtained from other methods in the literature and we report some improvements in the results obtained using our method.Comment: Accepted for publication in Proceedings of European Control Conference 202