This paper deals with stabilization of discrete-time switched linear systems when explicit knowledge of the state-space models of their subsystems is not available. Given the set of admissible switches between the subsystems, the admissible dwell times on the subsystems and a set of finite traces of state trajectories of the subsystems that satisfies certain properties, we devise an algorithm that designs periodic switching logics which preserve stability of the resulting switched system. We combine two ingredients: (a) data-based stability analysis of discrete-time linear systems and (b) multiple Lyapunov-like functions and graph walks based design of stabilizing switching logics, for this purpose. A numerical example is presented to demonstrate the proposed algorithm.
This paper deals with classes of (de)stabilizing switching signals for switched systems. Most of the available conditions for stability of switched systems are sufficient in nature, and consequently, their violation does not conclude instability of a switched system. The study of instability is, however, important for obvious reasons. Our contributions are twofold: Firstly, we propose a class of switching signals under which a continuous-time switched linear system is unstable. Our characterization of instability depends solely on the asymptotic behaviour of frequency of switching, frequency o…
Delft University of Technology（代尔夫特理工大学）；KTH Royal Institute of Technology（瑞典皇家理工学院）
For the identification of switched systems with a measured switching signal, this work aims to analyze the effect of switching strategies on the estimation error. The data for identification is assumed to be collected from globally asymptotically or marginally stable switched systems under switches that are arbitrary or subject to an average dwell time constraint. Then the switched system is estimated by the least-squares (LS) estimator. To capture the effect of the parameters of the switching strategies on the LS estimation error, finite-sample error bounds are developed in this work. The obt…
This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable and the set of admissible switching signals obeys pre-specified restrictions on switches between the subsystems and dwell times on the subsystems. We derive sufficient conditions on the subsystems matrices such that a switched system is globally exponentially stable under a set of purely time-dependent switching signals that obeys the given restrictions. The main apparatuses for our analysis are (matrix) commutation relations between certain products of the subsystems matrices and graph-t…
This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable. We present sufficient conditions on the subsystems matrices such that a switched system is globally exponentially stable under a set of purely time-dependent switching signals that are allowed to activate all subsystems. The main apparatuses for our analysis are (matrix) commutation relations between certain products of the subsystems matrices and graph-theoretic arguments. We present a numerical experiment to demonstrate our results.
Stability Analysis of Continuous-Time Switched Systems with a Random Switching Signal
University of Science and Technology of China（中国科学技术大学）；University of Hong Kong（香港大学）；University of Southampton（南安普顿大学）；University of Strathclyde（思克莱德大学）
The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct equilibrium points for each subsystem. First, under arbitrary switching rules, the stability analysis must be generally carried out with respect to a compact set with non-empty interior rather than to a singleton. We provide a novel proof technique for existence and outer approximation of attractive invariant sets of a switched affine system, under the hypothesis of global uniform stability of its linearization. On t…
We study the synthesis of mode switching protocols for a class of discrete-time switched linear systems in which the mode jumps are governed by Markov decision processes (MDPs). We call such systems MDP-JLS for brevity. Each state of the MDP corresponds to a mode in the switched system. The probabilistic state transitions in the MDP represent the mode transitions. We focus on finding a policy that selects the switching actions at each mode such that the switched system that follows these actions is guaranteed to be stable. Given a policy in the MDP, the considered MDP-JLS reduces to a Markov j…
A novel procedure for the online identification of a class of discrete-time switched linear systems, which simultaneously estimates the parameters and switching manifolds of the systems, is proposed in this paper. Firstly, to estimate the parameters of the subsystems, a discrete-time concurrent learning-based recursive parameter estimator is designed to guarantee the exponential convergence of the estimation errors to zero. Secondly, as an assistant procedure of the identification framework, an online switching detection method is proposed by making use of the history stacks produced by the co…
In this work, a data-driven modeling framework of switched dynamical systems under time-dependent switching is proposed. The learning technique utilized to model system dynamics is Extreme Learning Machine (ELM). First, a method is developed for the detection of the switching occurrence events in the training data extracted from system traces. The training data thus can be segmented by the detected switching instants. Then, ELM is used to learn the system dynamics of subsystems. The learning process includes segmented trace data merging and subsystem dynamics modeling. Due to the specific lear…
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…
Distributed switched large-scale systems are composed by dynamically coupled subsystems, in which interactions among subsystems vary over time according to an exogenous input signal named switching signal. In this paper, we present a distributed robust switched model-based predictive control (DSwMPC) to control such systems that are subject to local state and input constraints. The proposed method guarantees stabilizing the origin of the whole closed-loop system and ensures the constraints satisfaction in the presence of an unknown switching signal. In the distributed model-based predictive co…
Feedback stabilization of switched systems under arbitrary switching: A convex characterization
Aeronautics Institute of Technology (ITA)（巴西空军理工学院）；Politecnico di Torino（都灵理工大学）；Université Paris-Saclay, CNRS, CentraleSupélec, Laboratoire des Signaux et Systèmes（巴黎萨克雷大学、法国国家科学研究中心、中央苏佩莱克学院、信号与系统实验室）
Stabilizing switching signals: a transition from point-wise to asymptotic conditions
Robert Bosch Centre for Cyber-Physical Systems, Indian Institute of Science（印度科学学院罗伯特博世网络物理系统中心）；Systems & Control Engineering, Indian Institute of Technology Bombay（孟买印度理工学院系统与控制工程系）
Switched systems are known to exhibit subtle (in)stability behaviors requiring system designers to carefully analyze the stability of closed-loop systems that arise from their proposed switching control laws. This paper presents a formal approach for verifying switched system stability that blends classical ideas from the controls and verification literature using differential dynamic logic (dL), a logic for deductive verification of hybrid systems. From controls, we use standard stability notions for various classes of switching mechanisms and their corresponding Lyapunov function-based analy…
School for Engineering of Matter, Transport, and Energy, Arizona State University（亚利桑那州立大学物质、运输与能源工程学院）；Argonne National Laboratory（阿贡国家实验室）
In this paper, we present a provably correct controller synthesis approach for switched stochastic control systems with metric temporal logic (MTL) specifications with provable probabilistic guarantees. We first present the stochastic control bisimulation function for switched stochastic control systems, which bounds the trajectory divergence between the switched stochastic control system and its nominal deterministic control system in a probabilistic fashion. We then develop a method to compute optimal control inputs by solving an optimization problem for the nominal trajectory of the determi…
This paper deals with learning stability of partially observed switched linear systems under arbitrary switching. Such systems are widely used to describe cyber-physical systems which arise by combining physical systems with digital components. In many real-world applications, the internal states cannot be observed directly. It is thus more realistic to conduct system analysis using the outputs of the system. Stability is one of the most frequent requirement for safety and robustness of cyber-physical systems. Existing methods for analyzing stability of switched linear systems often require th…
The stability property of the loss-aversion-based noncooperative switched systems with quadratic payoffs is investigated. In this system, each agent adopts the lower sensitivity parameter in the myopic pseudo-gradient dynamics for the case of losing utility than gaining utility, and both systems' dynamics and switching events (conditions) are depending on agents' payoff functions. Sufficient conditions under which agents' state converges towards the Nash equilibrium are derived in accordance with the location of the Nash equilibrium. In the analysis, the mode transition sequence and interestin…
