A simple stability criterion for dynamical systems with stochastic switching and/or stochastic time-delays. (1st December 2022)

• Record Type: Journal Article
• Authors: Carter, Camille; Murri, Jacob; Reber, David; Webb, Benjamin
• Is Part Of: Nonlinearity. Volume 35:Number 12(2022)
• Page Start: 6042
• Page End: 6066
• Publication Date: 2022-12-01
• Subjects: switched systems -- time delays -- stability -- patient stability -- dynamical networks -- isoradial reductions; 37H30; Nonlinear theories -- Periodicals; Mathematical analysis -- Periodicals; Mathematical analysis; Nonlinear theories; Periodicals; 515
• DOI: 10.1088/1361-6544/ac9505
• Languages: English
• ISSNs: 0951-7715

Abstract

Abstract: In many natural and technological systems the rule that governs the system's dynamics changes over time. In such switched systems the system's switching can be a significant source of instability. Here we give a simple sufficient criterium to determine if an i.i.d. stochastically switched system is stable in expectation. This method extends recent results for linear switched systems to nonlinear switched systems. It also extends results known for general switched systems giving improved results for systems with i.i.d. stochastic switching. The paper also considers the effects of time-delays on the stability of switched systems. Such time delays, which are intrinsic to any real-world system, can also have a destabilising effect on the system's dynamics. Previously, it has been shown that if a dynamical system is intrinsically stable, which is a stronger form of global stability, then it maintains its stability even when time-delays are introduced into the system. Here we extend this notion to stochastically switched systems. We refer to this type of stability as patient stability and give a simple sufficient criterium under which such systems are patiently stable, i.e. cannot be destabilised by time delays. Both criteria introduced in this paper side step the need to use Lyapunov, linear matrix inequalities, and semi-definite programming-type methods. Our examples in this paper demonstrate the simplicity of these criteria.