Search

In this paper, we propose new algebraic Gramians for continuous-time switched linear systems, which satisfy generalized Lyapunov equations. The main contribution of this paper is twofold. First, we show that the ranges of those Gramians encode the reachability and observability spaces of a switched linear system. As a consequence, a simple Gramian-based criterion for reachability and observability is established. Second, a balancing-based model order reduction technique is proposed and, under some sufficient conditions, stability preservation and an error bound are shown. Finally, the efficiency of the proposed method is illustrated by means of numerical examples. [ABSTRACT FROM AUTHOR]

In this paper, we consider the l\infty gain characterizations of linear switched systems (LSS) and present various relevant results on their exact computation and optimization. Depending on the role of the switching sequence, we study two broad cases: first, when the switching sequence attempts to maximize, and second, when it attempts to minimize the l\infty gain. The first, named as worst-case throughout the paper, can be related to robustness of the system to uncontrolled switching; the second relates to situations when the switching can be part to the overall decision making. Although, in general, the exact computation of l\infty gains is difficult, we provide specific classes, the input-output switching systems, for which it is shown that linear programming can be used to obtain the worst-case l\infty gain. This is a sufficiently rich class of systems as any stable LSS can be approximated by one. Certain applications to robust control design are provided where we show that a switched compensation independently of the plant has no advantage over a linear time invariant (LTI) compensation, and further, if the plant is strictly causal, even a switched compensation which has a matched switching with the plant does not provide a better performance over an LTI compensation. Also, we present a new necessary and sufficient condition to check the stability of LSS in form of a model matching problem. On the other hand, if one is interested in minimizing the l\infty gain over the switching sequences, we show that, for finite impulse response (FIR) switching systems the minimizing switching sequence can be chosen to be periodic. For input-only or output-only switching an exact, readily computable, characterization of the minimal l\infty gain is provided, and it is shown that the minimizing switching sequence is constant, which, as also shown, is not true for input-output switching. [ABSTRACT FROM AUTHOR]

This note points out certain limitations of our results from the paper mentioned in the title, and provides a modified approach to overcome these limitations. Specifically, the observer design addressed in the aforementioned paper is, in general, only applicable to switched linear systems with invertible state reset maps and this note presents a modified algorithm for state estimation that can also handle non-invertible state reset maps. In the process, we also identify some equalities from that paper which may not hold in general for arbitrary state reset maps. [ABSTRACT FROM PUBLISHER]

This paper addresses the event-triggered dynamic output feedback control for switched linear systems with frequent asynchronism. Different from existing work, which limits at most once switching during an interevent interval, we adopt the average dwell time approach without limiting the minimum dwell time of each subsystem, and thus frequent switching is allowed to happen in an interevent interval. Since the difficulty in acquiring the full information of system states, the dynamic output feedback controller is taken into account to stabilize the switched system. By employing a controller-mode-dependent Lyapunov functional, stability criterion is proposed for the resulting closed-loop system, based on which the dynamic output feedback controller together with the mode-dependent event-triggered mechanism is codesigned. Besides, the existence of the lower bound on interevent intervals is attentively discussed, which gets rid of the Zeno behavior. Finally, the effectiveness of the proposed method is illustrated by numerical simulations. [ABSTRACT FROM AUTHOR]

In this paper, we propose a state-dependent switching controller for multiple-input multiple-output (MIMO) bilinear systems with constant delays in both the state and the input. The control input is assumed to be restricted to take only a finite number of values. The stability analysis of the closed loop is based on a Lyapunov–Krasovskii functional, and the design is reduced to solve a system of linear matrix inequalities. The controller can be designed by considering (state) delay-dependent or delay-independent conditions. [ABSTRACT FROM AUTHOR]

This paper is concerned with state estimation for a class of hidden semi-Markov jump linear systems governed by a two-layer stochastic process in the discrete-time context. A semi-Markov chain and an observed-mode sequence constitute the lower and upper layer of the process, respectively. With the aid of the emission probability, a novel filter, which is dependent both on the elapsed time within the activated mode and on the observed mode instead of the system mode, is constructed and called observed-mode-dependent (OMD) filter. A modified $\sigma$ -error mean square stability ($\sigma$ -MSS) is proposed by considering the weight of expected operation time in each actual system mode. Based on the new $\sigma$ -MSS, together with a class of Lyapunov functions depending on both the system modes and the corresponding observed ones, numerically checkable conditions on the existence of the OMD filter are presented such that the estimation error system is $\sigma$ -MSS with a prescribed $\mathcal {H}_{\infty }$ disturbance attenuation level. A numerical example is presented to demonstrate the theoretical findings. [ABSTRACT FROM AUTHOR]

This paper addresses the problems of determining the \mathcal H_2 norm and the root mean square (RMS) gain of continuous-time switched linear systems. A novel class of Lyapunov functions is proposed for reaching this goal, called homogeneous rational Lyapunov functions (HRLFs). It is shown that sufficient conditions for establishing upper bounds of the sought performance indexes in the case of arbitrary switching can be given in terms of linear matrix inequality (LMI) feasibility tests by searching for an HRLF of chosen degree. Moreover, it is shown that these conditions are also necessary by searching for an HRLF of degree sufficiently large. It is worth mentioning that necessary and sufficient LMI conditions have not been proposed yet in the literature for the considered problems. Hence, the paper continues by considering the case of switching with dwell time constraints, showing that analogous LMI conditions can be obtained for this case by searching for a family of HRLFs mutually constrained by the dwell time specification. Some numerical examples illustrate the proposed methodology and highlight the advantages with respect to the existing works. [ABSTRACT FROM AUTHOR]

This paper deals with the dead-beat stabilizability of autonomous discrete-time switched linear systems. Based on a constructive necessary and sufficient condition for dead-beat stabilizability, we propose two algorithms. The first one is concerned with the problem of testing dead-beat stabilizability and computing the shorter stabilizing mode sequence, whenever it exists. The other one implements a method to construct a switched system whose shorter dead-beat stabilizing sequence has a prescribed length. Then, we present numerical assessments and possible applications. [ABSTRACT FROM AUTHOR]

This paper investigates standard $H_\infty$ control of switched systems via dwell-time switchings without posing any internal stability requirements on subsystems of the switched systems. First, a sufficient condition is formed by specifying lower and upper bounds of the dwell time, constraining upper bound of derivative of a Lyapunov function of the active subsystem, and forcing the Lyapunov function values of the overall switched system to decrease at switching times to achieve standard $H_\infty$ control of unforced switched linear systems. Then, in the same framework of the dwell time, sufficient conditions are given for that of the corresponding forced switched linear systems by further designing state feedback controllers. Finally, numerical examples are provided to demonstrate the effectiveness of the proposed results. [ABSTRACT FROM AUTHOR]

Controlled distinguishability of two dynamical systems is the property of the systems that guarantees the existence of a control input generating different outputs of the systems regardless of their initial state vectors. These inputs are referred in the literature as discerning control inputs. In this paper, a necessary and sufficient condition for controlled distinguishability of continuous-time bilinear systems is established. It generalizes the classic one provided in the literature for the class of linear systems and a method for designing discerning inputs of bilinear systems that stabilize the systems is also proposed. [ABSTRACT FROM AUTHOR]

This paper considers the optimal control problem of linear switched systems with linear quadratic (LQ) cost or multiple LQ cost. By adopting an embedding transformation, the switching design problem is relaxed and transformed into a traditional optimal control problem. The bang–bang-type solutions of the embedded optimal control problems are obtained for both the positive definite LQ cost case and the multiple LQ cost case, which are the optimal solutions to the original problems. The switching sequence of modes and the switching instants can be calculated by solving a closed-form optimal switching condition. The optimal state feedback control law is determined simultaneously. Finally, numerical results are provided to illustrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we consider the event-triggered control problem for continuous-time switched linear systems. It is assumed that only the sampled information of system state and switching signal is available to the controller at each sampling instant. Based on a mode-dependent event-triggered transmission scheme, the closed-loop system is modeled as a switched system with delayed state and augmented switching signal. Then, an exponential stability condition, characterized by the dwell time and average dwell time of the switching signal, is obtained. The condition presents an extension of the multiple Lyapunov functional method based stability analysis for sampled-data control of nonswitched system. Consequently, the design methods for state-feedback controller gains and event-triggered parameters are then formulated by the properly selected quadratic Lyapunov functional. The analysis results are significant and also lead to an important step to study the event-triggered control for switched system. Finally, based on the definition of event-trigger efficiency, the effectiveness and improvement of the proposed approach are illustrated by two numerical examples. [ABSTRACT FROM AUTHOR]

This paper considers a singular problem in optimal control of continuous-time bimodal switched linear systems. A relaxed switched system with a continuous-valued switching signal is considered and the representations of singular control and singular arcs are derived. The similarity in the structure between the singular control and a stabilizing switching law is revealed and an approximation of the singular control by a well-defined switching signal is addressed. The results are demonstrated by numerical simulations. [ABSTRACT FROM AUTHOR]

We study feedback control for a discrete-time integrator with unitary delay in the presence of quantization both in the control action and in the measurement of the controlled variable. In some applications the quantization effects can be neglected, but when high precision is needed, they have to be explicitly accounted for in control design. In this paper, we propose a switched control solution for minimizing the effect of quantization of both the control and controlled variables for the considered system, that is quite common in the computing systems domain, for example, in thread scheduling, clock synchronization, and resource allocation. We show that the switched solution outperforms the one without switching, designed by neglecting quantization, and analyze necessary and sufficient conditions for the controlled system to exhibit periodic solutions in the presence of an additive constant disturbance affecting the control input. Simulation results provide evidence of the effectiveness of the approach. [ABSTRACT FROM AUTHOR]

In this paper we deal with the stabilizability property for discrete-time switched linear systems. A recent necessary and sufficient characterization of stabilizability, based on set theory, is considered as the reference for comparing the computation-oriented sufficient conditions. The classical BMI conditions based on Lyapunov-Metzler inequalities are considered and extended. Novel LMI conditions for stabilizability, derived from the geometric ones, are presented that permit to combine generality with computational affordability. For the different conditions, the geometrical interpretations are provided and the induced stabilizing switching laws are given. The relations and the implications between the stabilizability conditions are analyzed to infer and compare their conservatism and their complexity. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of modes detection for switching discrete-time linear and affine systems. A unified presentation of the model-based methods with the corresponding modes detectors is carried out and a comparative study is conducted. Next, the different notions of discernibility proposed in the literature are presented. Such notions are central since they guarantee the uniqueness of the solution delivered by the modes detectors. A complete step-by-step procedure of modes detection is proposed. The paper includes, whenever necessary, some extensions of the existing results. [ABSTRACT FROM AUTHOR]

The goal of this paper is to study the stabilizability of controlled discrete-time switched linear systems (CSLSs), where the discrete switching control input and the continuous control input coexist. For a given positive integer $h$ , we propose a quantitative metric of stabilizability, called $h$ -contraction rate ($h$ -CR), and prove that it serves as an indicator of the stabilizability in the following sense: the $h$ -CR is less than one for sufficiently large $h$ if and only if the switched linear system is stabilizable. In addition, we develop computational tools to estimate upper and lower bounds of the $h$ -CR. In particular, the upper bound estimation is expressed as a semidefinite programming problem. We derive its Lagrangian dual problem and prove that the dual problem with an additional rank constraint gives an exact characterization of the $h$ -CR. An algorithm is developed to solve the dual problem with the rank constraint. [ABSTRACT FROM AUTHOR]

In this paper, we address the optimal control problem for Boolean control networks (BCNs). We first consider the problem of finding the input sequences that minimize a given cost function over a finite time horizon. The problem solution is obtained by means of a recursive algorithm that represents the analogue for BCNs of the difference Riccati equation for linear systems. We prove that a significant number of optimal control problems for BCNs can be easily reframed into the present setup. In particular, the cost function can be adjusted so as to include penalties on the switchings, provided that we augment the size of the BCN state variable. In the second part of the paper, we address the infinite horizon optimal control problem and we provide necessary and sufficient conditions for the problem solvability. The solution is obtained as the limit of the solution over the finite horizon [0,T], and it is always achieved in a finite number of steps. Finally, the average cost problem over the infinite horizon, investigated in “Optimal control of logical control networks” (Y. Zhao , IEEE Trans. Autom. Control, vol 56, no. 8, pp. 1766–1776, Aug. 2011), is addressed by making use of the results obtained in the previous sections. [ABSTRACT FROM AUTHOR]

This paper addresses the output reachable set estimation problem for continuous-time switched linear systems consisting of Hurwtiz stable subsystems. Based on a common Lyapunov function approach, the output reachable set is estimated by a union of bounding ellipsoids. Then, multiple Lyapunov functions with time-scheduled structure are employed to estimate the output reachable set for switched systems under dwell-time constraint. Furthermore, the safety verification problem of uncertain switched systems is investigated based on the result of output reachable set estimation. First, a sufficient condition ensuring the existence of an approximate bisimulation relation between two switched linear systems with a prescribed precision is proposed. Then, the safety verification for an uncertain switched system can be performed through an alternative safety verification for a switched system with exact parameters. Numerical examples are provided to illustrate our results. [ABSTRACT FROM AUTHOR]

This paper investigates the state observer design of a class of unknown input switched linear systems via mode-dependent dwell time switchings. The distinguishing feature of the proposed method is that strong detectability condition of subsystems of the switched systems is unnecessarily required. First, a time-varying coordinate transformation is introduced to design a suitable reduced-order observer for each subsystem. Then, computable sufficient conditions on the synthesis of the observers are proposed in the framework of a mode-dependent dwell time technique. Since the observer of an individual subsystem cannot be designed due to unavailability of strong detectability condition of the subsystem, the state of the switched system is estimated under the condition of confining the dwell time by a pair of upper and lower bounds, restricting the growth of the Lyapunov function of the active subsystem and forcing “energy” of the overall switched system to decrease at switching instants. Finally, an example is presented to demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

This paper is concerned with a class of discrete-time semi-Markov jump linear systems (S-MJLSs) subject to exponentially modulated periodic (EMP) probability density function (PDF) of sojourn time, and the problems of stability and stabilization are addressed. Setting a relatively large period, the considered systems are capable of approximating the general S-MJLSs (without any requirements on sojourn-time PDFs) for which numerically testable stability and stabilization conditions are rather difficult to obtain. Necessary and sufficient criterion for mean square stability of the general S-MJLSs is first derived, which involves an infinite number of conditions and as such not checkable. However, the developments lay a foundation to further establish the numerically testable conditions for the systems when the PDF of sojourn time is EMP albeit the sojourn time can tend to infinity. The derivations explicitly depend on the PDF of sojourn time, which circumvents the difficulty in obtaining the memory transition probabilities of S-MJLSs. The adopted Lyapunov function is sojourn-time-dependent (STD), by which the existence conditions of STD controller are developed as well using certain techniques that can eliminate the terms of power of matrices in the stability conditions. Two illustrative examples including a class of population ecological systems are presented to show the validity and applicability of the developed theoretical results. [ABSTRACT FROM AUTHOR]

A moment-matching method for model reduction of linear switched systems (LSSs) is presented. The method can be seen as a non-trivial extension of the Krylov subspace methods for linear time-invariant (LTI) systems. The procedure is based on the so called “nice selections,” which represent a choice of basis in the reachability or observability space of the LSS. The framework can also be used for exact matching of the input-output behavior of an LSS with a reduced order LSS for a specific switching sequence. Conditions for applicability of the method for model reduction are stated and finally the results are illustrated on numerical examples. [ABSTRACT FROM PUBLISHER]

This paper deals with model reduction by balanced truncation of switched linear systems (SLS). We consider switched linear systems whose dynamics, depending on the switching signal, switches between finitely many linear systems with a common state space. These linear systems are called the modes of the SLS. The idea is to seek for conditions under which there exists a single state space transformation that brings all modes of the SLS in balanced coordinates. As a measure of reachability and observability of the state components of the SLS, we take the average of the diagonal gramians. We then perform balanced truncation by discarding the state components corresponding to the smallest diagonal elements of this average balanced gramian. In order to carry out this program, we derive necessary and sufficient conditions under which a finite collection of linear systems with common state space can be balanced by a single state space transformation. Among other things, we derive sufficient conditions under which global uniform exponential stability of the SLS is preserved under simultaneous balanced truncation. Likewise, we derive conditions for preservation of positive realness or bounded realness of the SLS. Finally, in case that the conditions for simultaneous balancing do not hold, or we simply do not want to check these conditions, we propose to compute a suitable state space transformation on the basis of minimization of an overall cost function associated with the modes of the SLS. We show that in case our conditions do hold, this transformation is in fact simultaneously balancing, bringing us back to the original method described in this paper. [ABSTRACT FROM AUTHOR]

In this paper, we study the stability of networked control systems (NCSs) that are subject to time-varying transmission intervals, time-varying transmission delays, and communication constraints. Communication constraints impose that, per transmission, only one node can access the network and send its information. The order in which nodes send their information is orchestrated by a network protocol, such as, the Round-Robin (RR) and the Try-Once-Discard (TOD) protocol. In this paper, we generalize the mentioned protocols to novel classes of so-called “periodic” and “quadratic” protocols. By focusing on linear plants and controllers, we present a modeling framework for NCSs based on discrete-time switched linear uncertain systems. This framework allows the controller to be given in discrete time as well as in continuous time. To analyze stability of such systems for a range of possible transmission intervals and delays, with a possible nonzero lower bound, we propose a new procedure to obtain a convex overapproximation in the form of a polytopic system with norm-bounded additive uncertainty. We show that this approximation can be made arbitrarily tight in an appropriate sense. Based on this overapproximation, we derive stability results in terms of linear matrix inequalities (LMIs). We illustrate our stability analysis on the benchmark example of a batch reactor and show how this leads to tradeoffs between different protocols, allowable ranges of transmission intervals and delays. In addition, we show that the exploitation of the linearity of the system and controller leads to a significant reduction in conservatism with respect to existing approaches in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we propose continuous-time and sampled-data output feedback controllers for nonlinear multi-input multi-output systems with time-varying measurement and input delays, with no restriction on the bound or serious limitations on the growth of the nonlinearities. A state prediction is generated by chains of saturated high-gain observers with switching error-correction terms and the state prediction is used to stabilize the system with saturated controls. The observers reconstruct the unmeasurable states at different delayed time-instants, which partition the maximal variation interval of the time-varying delays. These delayed time instant depend both on the magnitude of the delays and the growth rate of the nonlinearities. We also design sampled-data stabilizers as zero-order discretization of a hybrid modification (with continuous-time states and discrete-time control and innovations) of the continuous-time stabilizers. [ABSTRACT FROM AUTHOR]

Necessary and sufficient conditions for the stability of linear continuous-time systems with stochastically switching delays are presented in this paper. It is assumed that the delay random paths are piece-wise constant functions of time where a finite number of values may be taken by the delay. The stability is assessed in terms of the second moment of the state vector of the system. The solution operators of individual linear systems with constant delays, chosen from the set of all possible delay values, are extended to form new augmented operators. Then for proper formulation of the second moment in continuous time, tensor products of the augmented solution operators are used. Finally the finite-dimensional versions of the stability conditions, that can be obtained using various time discretization techniques, are presented. Some examples are provided that demonstrate how the stability conditions can be used to assess the stability of linear systems with stochastic delay. [ABSTRACT FROM AUTHOR]

In this paper, the stability and $L_2$ -gain properties of linear impulsive delay systems with delayed impulses are studied. Commonly employed techniques, in which the delayed impulses are treated using Newton–Leibniz formula, may not be applicable to $L_2$ -gain analysis, since they make the disturbance input appear in the impulse part. In order to circumvent the difficulty, we first augment the considered system to a time-delay system with switching nondelayed impulses. Due to the absence of delayed impulses, this new approach has advantages in constructing Lyapunov functions and handling the effects of impulse delays on the system performance. Switching-based time-dependent Lyapunov functions are introduced to deal with the resultant switching impulses of the augmented system. Sufficient conditions for exponential stability and $L_2$ -gain properties are derived in terms of linear matrix inequalities. Numerical examples are provided to illustrate the efficiency of the new approach. [ABSTRACT FROM AUTHOR]

In this note, we investigate the stabilization of discrete-time linear systems with an unknown time-varying delay. Existing literature on the stabilization of time-delay systems require some knowledge, such as an upper bound, of the delay. In this paper, by proposing a switched low-gain feedback control law, we are able to achieve asymptotic stabilization of the system without any knowledge of the delay. In addition, the proposed switched low-gain feedback law also significantly improves the closed-loop system performance in terms of overshoot and convergence speed in comparison with the traditional fixed gain design. Simulation study illustrates the effectiveness of our theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of constructing a finite bisimulation quotient for a discrete-time switched linear system in a bounded subset of its state space. Given a set of observations over polytopic subsets of the state space and a switched linear system with stable subsystems, the proposed algorithm generates the bisimulation quotient in a finite number of steps with the aid of sublevel sets of a polyhedral Lyapunov function. Starting from a sublevel set that includes the origin in its interior, the proposed algorithm iteratively constructs the bisimulation quotient for the region bounded by any larger sublevel set. We show how this bisimulation quotient can be used for synthesis of switching laws and verification with respect to specifications given as syntactically co-safe Linear Temporal Logic formulae over the observed polytopic subsets. [ABSTRACT FROM AUTHOR]

In this paper, the state dynamics of a supervisor implemented with a digital sequential system are represented with a finite state machine (FSM). The supervisor monitors a symbol sequence derived from a linear closed-loop system's performance and generates a switching signal for the closed-loop system. The effect of random events on the performance of the closed-loop system is analyzed by adding an exogenous Markov process input to the FSM, and by appropriately augmenting a switched system representation of the supervisor and the closed-loop system. For this class of hybrid jump linear systems, the switching signal is, in general, a non-Markovian process, making it hard to analyze its stability properties. This is ameliorated by introducing a sufficient mean square stability test that uses only upper bounds on the one-step transition probabilities of the switching signal. These bounds are explicitly derived from a Markov kernel associated with the hybrid system model. This stability test becomes necessary and sufficient when the switching signal is Markovian. To determine tighter stability bounds, procedures to determine the upper-bound transition probability matrices when the FSM has a Moore or a Mealy type output map are presented. Two examples illustrate the applicability of the presented results. [ABSTRACT FROM PUBLISHER]

This paper presents a fault-tolerant control scheme for constrained discrete-time linear systems against stuck actuators and bounded disturbances. The results proposed here are a significant generalization of a similar algorithm that has been designed only to manage healthy/out-of-service actuator units. A key feature of the proposed scheme consists of taking advantage of polyhedral algebra and computational geometry concepts in order to characterize the reconfiguration logic of the proposed fault-tolerant architecture. This is achieved by describing the plant via a set of a finite number of piecewise affine (PWA) systems capable to cover all the admissible faulty stuck scenarios. It is then proved that one-step sequences of controllable sets can be formally defined within a PWA system paradigm under the key property that each region is a polyhedron. [ABSTRACT FROM AUTHOR]

This paper introduces the concept of consistency for continuous-time switched linear systems having the switching function as a primary control signal to be designed. A switching control strategy is strictly consistent whenever it improves performance compared to the ones of all isolated subsystems. Conditions under which a min-type switching strategy is strictly consistent for the classes of \cal H2 and \cal H\infty performance indexes are determined. This property makes clear the importance of switching systems control design in both theoretical and practical application frameworks. Moreover, with this property it is not necessary to assume that all the subsystems are not stable in order to make a switching strategy design problem well posed. The theory is illustrated by means of several academic examples. [ABSTRACT FROM PUBLISHER]

This paper presents a characterization of observability and an observer design method for switched linear systems with state jumps. A necessary and sufficient condition is presented for observability, globally in time, when the system evolves under predetermined mode transitions. Because this characterization depends upon the switching signal under consideration, the existence of singular switching signals is studied alongside developing a sufficient condition that guarantees uniform observability with respect to switching times. Furthermore, while taking state jumps into account, a relatively weaker characterization is given for determinability, the property that concerns with recovery of the original state at some time rather than at all times. Assuming determinability of the system, a hybrid observer is designed for the most general case to estimate the state of the system and it is shown that the estimation error decays exponentially. Since the individual modes of the switched system may not be observable, the proposed strategy for designing the observer is based upon a novel idea of accumulating the information from individual subsystems. Contrary to the usual approach, dwell-time between switchings is not necessary, but the proposed design does require persistent switching. For practical purposes, the calculations also take into account the time consumed in performing computations. [ABSTRACT FROM AUTHOR]

This paper is concerned with the derivation of a model reference adaptive control (MRAC) scheme for multimodal piecewise-affine (PWA) and piecewise-linear systems. The control allows the plant to track asymptotically the states of a multimodal piecewise affine (or smooth) reference model. The reference model can be characterized by a number and geometry of phase space regions that can be entirely different from those of the plant. Numerical simulations on a set of representative examples confirm the theoretical derivation and proof of stability. [ABSTRACT FROM AUTHOR]

This paper is concerned with a class of random jump systems represented by transition operators, which includes switched linear systems with strictly stationary switching signals in infinite modes space as its special case. A series of necessary and sufficient conditions are established for almost sure stability of this class of random jump systems under different scenarios. The stability criteria obtained are further extended to Markov jump linear systems with infinite states, and hence a unified approach to describing the almost sure stability of MJLSs is addressed under this context. All the results in the work are developed for both the continuous- and discrete-time systems. [ABSTRACT FROM AUTHOR]

In this paper, the stability and stabilization problems for a class of switched linear systems with mode-dependent average dwell time (MDADT) are investigated in both continuous-time and discrete-time contexts. The proposed switching law is more applicable in practice than the average dwell time (ADT) switching in which each mode in the underlying system has its own ADT. The stability criteria for switched systems with MDADT in nonlinear setting are firstly derived, by which the conditions for stability and stabilization for linear systems are also presented. A numerical example is given to show the validity and potential of the developed techniques. [ABSTRACT FROM PUBLISHER]

This paper studies the quadratic regulation problem for discrete-time switched linear systems (DSLQR problem) on an infinite time horizon. A general relaxation framework is developed to simplify the computation of the value iterations. Based on this framework, an efficient algorithm is developed to solve the infinite-horizon DSLQR problem with guaranteed closed-loop stability and suboptimal performance. Due to these guarantees, the proposed algorithm can be used as a general controller synthesis tool for switched linear systems. [ABSTRACT FROM PUBLISHER]

In this paper, we first establish a stability result for a class of linear switched systems involving Kronecker product. The problem is interesting in that the system matrix does not have to be Hurwitz at any time instant. This class of linear switched systems arises in the control of multi-agent systems under switching network topology. As applications of this stability result, we give the solvability conditions for both the leaderless consensus problem and the leader-following consensus problem for general marginally stable linear multi-agent systems under switching network topology. In contrast with some existing results, our results only assume that the dynamic graph is uniformly connected. [ABSTRACT FROM AUTHOR]

This paper introduces the notion of common zeroing-output systems (CZOS) to analyze the stability of switched systems. The concept of CZOS allows one to verify weak zero-state detectability. It characterizes a common behavior of any individual subsystem when the output signal for each subsystem is “approaching” zero. Heuristically speaking, it removes the effect of switching behavior, and thus enables one to analyze stability properties in systems with complex switching signals. With the help of CZOS, the Krasovskii–LaSalle theorem can be extended to switched nonlinear time-varying systems with both arbitrary switching and more general restricted switching cases. For switched nonlinear time-invariant systems, the needed detectability condition is further simplified, leading to several new stability results. Particularly, when a switched linear time-invariant system is considered, it is possible to generate a recursive method, which combines a Krasovskii–LaSalle result and a nested Matrosov result, to find a CZOS if it exists. The power of the proposed CZOS is demonstrated by consensus problems in literature to obtain a stronger convergence result with weaker conditions. [ABSTRACT FROM AUTHOR]

This paper studies the problem of stabilizing discrete-time switched linear control systems (SLCSs) using continuous input by a user against adversarial switching by an adversary. It is assumed that at each time the adversary knows the user's decision on the continuous input but not vice versa. A quantitative metric of stabilizability is proposed. Systems at the margin of stabilizability are further classified and studied via the notions of defectiveness and reducibility. Analytical bounds on the stabilizability metric are derived using (semi)norms, with tight bounds provided by extremal norms. Numerical algorithms are also developed for computing this metric. An application example in networked control systems is presented. [ABSTRACT FROM AUTHOR]

The goal of this paper is to study the exponential stabilization problem for autonomous discrete-time switched linear systems (SLSs), where only the discrete mode can be controlled. Our approach is based on periodic control Lyapunov functions whose value decreases periodically instead of at each time step as in the classical control Lyapunov functions. Using periodic control Lyapunov functions, we develop stabilizability analysis and controller synthesis conditions that are less conservative than existing results in that they apply to a larger class of SLSs. Utilizing recent results on the switched optimal control problems, a constructive way to find periodic control Lyapunov functions is presented. [ABSTRACT FROM PUBLISHER]

We investigate the stabilizability of switched linear systems of differential-algebraic equations (DAEs). For such systems we introduce a parameterized family of switched ordinary differential equations that approximate the dynamic behavior of the switched DAE. A necessary and sufficient criterion for the stabilizability of a switched DAE system using time-dependent switching is obtained in terms of these parameterized approximations. Furthermore, we provide conditions for the stabilizability of switched DAEs via fast switching as well as using solely the consistency projectors of the constituent systems. The stabilization of switched DAEs with commuting vector fields is also analyzed. [ABSTRACT FROM PUBLISHER]

In this paper we consider the class of discrete-time switched systems switching between p autonomous positive subsystems. First, sufficient conditions for testing stability, based on the existence of special classes of common Lyapunov functions, are investigated, and these conditions are mutually related, thus proving that if a linear copositive common Lyapunov function can be found, then a quadratic positive definite common function can be found, too, and this latter, in turn, ensures the existence of a quadratic copositive common function. Secondly, stabilizability is introduced and characterized. It is shown that if these systems are stabilizable, they can be stabilized by means of a periodic switching sequence, which asymptotically drives to zero every positive initial state. Conditions for the existence of state-dependent stabilizing switching laws, based on the values of a copositive (linear/quadratic) Lyapunov function, are investigated and mutually related, too. [ABSTRACT FROM PUBLISHER]

This paper investigates sufficient conditions for the convergence to zero of the trajectories of linear switched systems. We provide a collection of results that use weak dwell-time, dwell-time, strong dwell-time, permanent and persistent activation hypothesis. The obtained results are shown to be tight by counterexample. Finally, we apply our result to the three-cell converter. [ABSTRACT FROM AUTHOR]

The problem of designing a switching and control policy for regulating the state of a switched linear system to zero while minimizing a quadratic cost appears in numerous applications. However, obtaining the optimal policy is in general computationally intractable. Here, we propose a class of suboptimal policies that exploit information, in terms of upper or lower bounds, on the optimal cost. We analyze the performance of these novel policies, obtaining new bounds on the optimal cost which are tighter than the initial ones. The usefulness of these policies and performance bounds is illustrated in the context of resource-aware control. [ABSTRACT FROM AUTHOR]

This work proposes a model predictive control (MPC) approach for a switching linear system where the switching signal is prescribed with unknown future values. The switching signal is known only at its current value, satisfies a minimal dwell-time restriction of $\tau$ steps between successive switchings and is otherwise arbitrary. Under such a setting, the MPC optimization problem has to allow for all admissible switching sequences within a given horizon length. Such a formulation necessitates several other features: the use of a modified returnable set as the terminal constraint; the introduction of consistency constraints on the predicted controls; a min-max optimization criterion as the cost function; the splitting of the horizon into two portions for recursive feasibility consideration and exponential stability of the closed-loop system. The proposed approach is demonstrated by a numerical example. [ABSTRACT FROM AUTHOR]

This article investigates the robust cooperative output regulation problem of heterogeneous uncertain linear multiagent systems with switching topologies and infinite distributed communication delays. A novel distributed observer is proposed for each agent to estimate the state of the so-called exosystem by taking consideration of both switching topologies and infinite distributed communication delays. A distributed output feedback controller is then developed based on the internal model principle and the estimated state without using the prior knowledge of communication delays. It is shown via the newly developed Lyapunov-like method that the robust cooperative output regulation problem can be solved under some mild assumptions. Finally, a numerical example is given to demonstrate the effectiveness of the proposed controller. [ABSTRACT FROM AUTHOR]

This article is devoted to the problem of detectability of a large class of linear stochastic systems with time varying coefficients simultaneously affected by state multiplicative white noise perturbations and Markovian switching. The main contribution of this article is to propose a Popov–Belevich–Hautus-type test, which is equivalent to the detectability of the considered stochastic systems in the sense that all unstable modes produce some nonzero output. The proposed setting unifies in some sense the discrete-time and continuous-time ones, dissimilarly to the vast majority of existing works that study discrete and continuous time separately. [ABSTRACT FROM AUTHOR]

Observability of a hybrid system is defined as the ability to determine the continuous state of the system. Whether a hybrid system is observable or not depends on which events can be disabled, which events can be forced, and the connectivity of the discrete states, as well as its continuous dynamics. We model a hybrid system using a hybrid machine that takes into consideration both continuous variables and discrete events. We classify hybrid systems into four classes based on their discrete-event parts. For each class, conditions are derived to check observability. If a hybrid system is not observable, then we check if a weaker version of observability, called $B$ -observability, is satisfied. $B$ -observability requires that a hybrid system become observable after some finite occurrences of events. Conditions are derived to check $B$ -observability. These conditions involve both the discrete-event and continuous-variable parts of hybrid systems. If the continuous-variable part of a system has a constant- $A$ matrix, then the conditions for the continuous-variable part can be simplified. We illustrate the results by an example of a battery management system of an electric vehicle. [ABSTRACT FROM AUTHOR]

In this note, we first propose an adaptive distributed observer for a linear leader system. This observer only assumes those followers who are the children of the leader know the system matrix of the leader system. Then, we further develop a distributed adaptive controller utilizing this adaptive distributed observer to solve the leader-following consensus problem for multiple uncertain Euler-Lagrange systems without assuming that all the followers need to know the system matrix of the leader system. [ABSTRACT FROM AUTHOR]