Practical Stabilization of Switched Affine Systems under Dwell Time: From Polytopic to p-Norm Lyapunov Functions
Centro Internacional Franco-Argentino de Cs. de la Información y de Sistemas (CIFASIS), UNR–CONICET（中法阿根廷信息与系统国际中心（CIFASIS），罗萨里奥国立大学-国家科学研究委员会）；Military Institute of Engineering（军事工程学院）
Starting from a finite family of continuously differentiable positive definite functions, we study conditions under which a function obtained by max-min combinations is a Lyapunov function, establishing stability for two kinds of nonlinear dynamical systems: a) Differential inclusions where the set-valued right-hand-side comprises the convex hull of a finite number of vector fields, and b) Autonomous switched systems with a state-dependent switching signal. We investigate generalized notions of directional derivatives for these max-min functions, and use them in deriving stability conditions w…
We study stability criteria for discrete-time switched systems and provide a meta-theorem that characterizes all Lyapunov theorems of a certain canonical type. For this purpose, we investigate the structure of sets of LMIs that provide a sufficient condition for stability. Various such conditions have been proposed in the literature in the past fifteen years. We prove in this note that a family of languagetheoretic conditions recently provided by the authors encapsulates all the possible LMI conditions, thus putting a conclusion to this research effort. As a corollary, we show that it is PSPAC…
This paper deals with the stability analysis problem of discrete-time switched linear systems with ranged dwell time. A novel concept called L-switching-cycle is proposed, which contains sequences of multiple activation cycles satisfying the prescribed ranged dwell time constraint. Based on L-switching-cycle, two sufficient conditions are proposed to ensure the global uniform asymptotic stability of discrete-time switched linear systems. It is noted that two conditions are equivalent in stability analysis with the same $L$-switching-cycle. These two sufficient conditions can be viewed as gener…
This paper tackles state feedback control of switched linear systems under arbitrary switching. We propose a data-driven control framework that allows to compute a stabilizing state feedback using only a finite set of observations of trajectories with quadratic and sum of squares (SOS) Lyapunov functions. We do not require any knowledge on the dynamics or the switching signal, and as a consequence, we aim at solving \emph{uniform} stabilization problems in which the feedback is stabilizing for all possible switching sequences. In order to generalize the solution obtained from trajectories to t…
Recent works have shown that the $L_1$ and $L_\infty$-gains are natural performance criteria for linear positive systems as they can be characterized using linear programs. Those performance measures have also been extended to linear positive impulsive and switched systems through the concept of hybrid $L_1\times\ell_1$-gain. For LTI positive systems, the $L_\infty$-gain is known to coincide with the $L_1$-gain of the transposed system and, as a consequence, one can use linear copositive Lyapunov functions for characterizing the $L_\infty$-gain of LTI positive systems. Unfortunately, this does…
This paper investigates the design of decentralized output-feedback controllers for a class of a large scale switched nonlinear systems under arbitrary switching laws. A global large scale switched system can be split into a set of smaller interconnected switched Takagi Sugeno fuzzy subsystems. Then, in order to stabilize the overall closed-loop system, a set of switched non-PDC static output controllers is employed. The latter is designed based on Linear Matrix Inequality (LMI) conditions obtained from a multiple switched non quadratic-like Lyapunov candidate function. The controllers propose…
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 stability of the underlying system with a user-defined confidence. The number of observations required to attain this confidence level on the guarantee is explicitly characterized. Our contribution is twofold: first, we propose a novel approach for common quadratic Lyapunov functions, relying on sensitivity analysis of a quasi-convex optimization program. B…
In this paper, we study the application of switched systems stability criteria to derive delay-dependent conditions for systems affected by both a constant and a time-varying delay. The main novelty of our approach lies on the use of path-complete Lyapunov techniques along with the proposition of a new modified functional to obtain convex analysis conditions while avoiding the need of computing a dwell time for each mode in a switched system representation, as usual in the \textit{switched approach} for time-delay systems. Furthermore, we leverage the developed analysis to obtain LMIs for the …
We show that the existence of a non-coercive Lyapunov function is sufficient for uniform global asymptotic stability (UGAS) of infinite-dimensional systems with external disturbances provided the speed of decay is measured in terms of the norm of the state and an additional mild assumption is satisfied. For evolution equations in Banach spaces with Lipschitz continuous nonlinearities these additional assumptions become especially simple. The results encompass some recent results on linear switched systems on Banach spaces. Finally, we derive new non-coercive converse Lyapunov theorems and give…
A class of discrete-time nonlinear positive time-delay switched systems with sector-type nonlinearities is studied. Sufficient conditions for the existence of common and switched diagonal Lyapunov--Krasovskii functionals for this system class are derived; these are expressed as feasibility conditions for systems of linear algebraic inequalities. Corresponding spectral conditions for the existence of common L--K functionals are also described. Furthermore, it is shown that the proposed approaches can be applied to discrete-time models of digital filters and neural networks. Finally, a numerical…
We present an algorithmic framework for the identification of candidate invariant subspaces for switched linear systems. Namely, the framework allows to compute an orthonormal basis in which the matrices of the system are close to block-triangular matrices, based on a finite set of observed one-step trajectories and with a priori confidence level. The link between the existence of an invariant subspace and a common block-triangularization of the system matrices is well known. Under some assumptions on the system, one can also infer the existence of an invariant subspace when the matrices are c…
Motivated by recent applications in control theory, we study the feedback stabilizability of switched systems, where one is allowed to chose the switching signal as a function of $x(t)$ in order to stabilize the system. We propose new algorithms and analyze several mathematical features of the problem which were unnoticed up to now, to our knowledge. We prove complexity results, (in-)equivalence between various notions of stabilizability, existence of Lyapunov functions, and provide a case study for a paradigmatic example introduced by Stanford and Urbano.
We propose an extension of the theory of control sets to the case of inputs satisfying a dwell-time constraint. Although the class of such inputs is not closed under concatenation, we propose a suitably modified definition of control sets that allows to recover some important properties known in the concatenable case. In particular we apply the control set construction to dwell-time linear switched systems, characterizing their maximal Lyapunov exponent looking only at trajectories whose angular component is periodic. We also use such a construction to characterize supports of invariant measur…
The stability problem of a class of nonlinear switched systems defined on compact sets with state-dependent switching is considered. Instead of the Caratheodory solutions, the general Filippov solutions are studied. This encapsulates solutions with infinite switching in finite time and sliding modes in the neighborhood of the switching surfaces. In this regard, a Lyapunov-like stability theorem, based on the theory of differential inclusions, is formulated. Additionally, the results are extended to switched systems with simplical uncertainty. It is also demonstrated that, for the special case …
We study path-complete Lyapunov functions, which are stability criteria for switched systems, described by a combinatorial component (namely, an automaton), and a functional component (a set of candidate Lyapunov functions, called the template). We introduce a class of criteria based on what we call memory-based Lyapunov functions, which generalize several techniques in the literature. Our main result is an equivalence result: any path-complete Lyapunov function is equivalent to a memory-based Lyapunov function, however defined on another template. We show the usefulness of our result in terms…
