- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Discrete Dynamics in Nature and Society
Volume 2009 (2009), Article ID 315713, 28 pages
Stability Results of a Class of Hybrid Systems under Switched Continuous-Time and Discrete-Time Control
1Department of Electricity and Electronics, Faculty of Science and Technology, University of the Basque Country, Campus of Leioa (Bizkaia), Aptdo, 644-Bilbao, Spain
2Department of Telecommunication and Systems Engineering, Engineering School, Autonomous University of Barcelona, Cerdanyola del Vallés, Bellaterra, 08193 Barcelona, Spain
Received 6 November 2008; Revised 5 March 2009; Accepted 24 March 2009
Academic Editor: Antonia Vecchio
Copyright © 2009 M. De la Sen and A. Ibeas. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
This paper investigates the stability properties of a class of switched systems possessing several linear time-invariant parameterizations (or configurations) which are governed by a switching law. It is assumed that the parameterizations are stabilized individually via an appropriate linear state or output feedback stabilizing controller whose existence is first discussed. A main novelty with respect to previous research is that the various individual parameterizations might be continuous-time, discrete-time, or mixed so that the whole switched system is a hybrid continuous/discrete dynamic system. The switching rule governs the choice of the parameterization which is active at each time interval in the switched system. Global asymptotic stability of the switched system is guaranteed for the case when a common Lyapunov function exists for all the individual parameterizations and the sampling period of the eventual discretized parameterizations taking part of the switched system is small enough. Some extensions are also investigated for controlled systems under decentralized or mixed centralized/decentralized control laws which stabilize each individual active parameterization.
The stabilization of dynamic systems is a very important question since it is the first requirement for most of applications. Powerful techniques for studying the stability of dynamic systems are Lyapunov stability theory and fixed point theory. Those techniques can be easily extended from the linear time-invariant case to the time-varying one as well as to functional differential equations as those arising, for instance, from the presence of internal delays, and to certain classes of nonlinear systems, [1, 2]. Dynamic systems which are of increasing interest are the so-called switched systems which consist of a set of individual parameterizations and a switching law which selects along time which parameterization is active. Switched systems are essentially time-varying by nature even if all the individual parameterizations are time-invariant. The interest of such systems arises from the fact that some existing systems in the real world modify their parameterizations to better adapt to their environments. Another important interest relies on the fact that changes of parameterizations through time can lead to benefits in certain applications [3–13]. The natural way of modelling these situations lies in the definition of appropriate switched dynamic systems. For instance, the asymptotic stability of Liénard-type equations with Markovian switching is investigated in [4, 5]. Also, time-delay dynamic systems are very important in the real life for appropriate modelling of certain biological and ecology systems and they are present in physical processes implying diffusion, transmission, teleoperation, population dynamics, war and peace models, and so forth (see, e.g., [1, 2, 12–18].)
A switched system can also be associated with the use of a multimodel scheme, a multicontroller scheme, a buffer system or a multiestimation scheme. For instance, a non exhaustive list of papers with deal with some of these questions related to switched systems follow.(1)In , the problem of delay-dependent stabilization for singular systems with multiple internal and external incommensurate delays is focused on. Multiple memory-less state-feedback controls are designed so that the resulting closed-loop system is regular independent of delays, impulse-free, and asymptotically stable.(2)In , the problem of the N-buffer switched flow networks is discussed based on a theorem on positive topological entropy.(3)In , a multimodel scheme is used for the regulation of the transient regime occurring between stable operation points of a tunnel diode-based triggering circuit.(4)In [21, 22], a parallel multiestimation scheme is derived to achieve close-loop stabilization in robotic manipulators whose parameters are not perfectly known. The multiestimation scheme allows the improvement of the transient regime compared to the use of a single estimation scheme while achieving at the same time closed-loop stability.(5)In , a parallel multiestimation scheme allows the achievement of an order reduction of the system prior to the controller synthesis so that this one is of reduced-order (then less complex) while maintaining closed-loop stability.(6)In , the stabilization of switched dynamic systems is discussed through topologic considerations via graph theory.(7)The stability of different kinds of switched systems subject to delays has been investigated in [11–13, 17].(8)The stability switch and Hopf bifurcation for a diffusive prey-predator system is discussed in  in the presence of delay.(9)A general theory with discussed examples concerning dynamic switched systems is provided in .
The main objectives of this manuscript are as follows.(a)To investigate the validity of Lyapunov functions of continuous-time systems after their discretization through zero-order holds under a sufficiently small-sampling period.(b)To incorporate as individual parameterizations continuous-time and discrete-time parameterizations, and even discretized versions of certain continuous-time parameterizations, which remain as valid discrete-time parameterizations of the whole switched system. If all those parameterizations share a common Lyapunov function then the switched system is proved to be stable under arbitrary switching. It turns out that the switched system lies in the class of hybrid switched controlled systems due to the capability of mixing distinct continuous-time and discrete-time controlled parameterizations through time while guaranteeing closed-loop stability. In this context, the configuration of the general switched system is novel related to previous configurations on the subject dealt with in the literature.(c)To investigate centralized/decentralized stabilizing control laws for a switched system of the above class.
The paper is organized as follows. Section 2 discusses the existence of a common Lyapunov function for a linear continuous-time parameterization and its discretized counterpart under sufficiently small-sampling period. It is then discussed in Section 3 the global asymptotic stability and stabilization for a switched system consisting of a set of continuous-time and discrete-time parameterizations which share a common Lyapunov function. The stabilizing controllers are assumed to be either of linear state-feedback type or output-feedback type. Firstly, their existence is discussed under standard assumptions of controllability and either observability or stabilizability for the individual parameterizations.
The switched system lies in a class of linear hybrid switched systems since the various individual parameterizations as well as their associate controllers may be either continuous-time or discrete-time or even mixed, and operating as potentially active, in the whole switched system. The feedback controller has the form where the discrete map governs the selection of the controller matrix values for the next time interval where the current controller parameterization is active. If the whole controlled system is hybrid then is defined by and is either the sate or output vectors of the dynamic system. If the controller parameterization is the discretization of a continuous one then , where is a sufficiently small, in general time-varying, sampling period. The sampling period is required to be sufficiently small in order that the discretized parameterizations would be able to share a common Lyapunov function with the continuous-time ones according to previous mathematical proofs in Section 2. Section 4 extends the results of Sections 2 and 3 to the synthesis of decentralized controllers for a switched system composed of coupled linear subsystems. In general, the decentralized controller is not purely decentralized in the sense that some couplings between distinct subsystems are allowed to exist and the related information is used by both controllers to synthesize the control law. At the same time, the use of centralized controllers for some of the subsystems is also allowed. The case of synthesizing purely decentralized controllers is also discussed. Some examples are discussed in Section 5.
, , and are the sets of complex, real, and integer numbers, respectively.
and are the sets of positive real and integer numbers, respectively, and is the set of complex numbers with positive real part.
, where is the complex unity, and .
and are the sets of negative real and integer numbers, respectively, and is the set of complex numbers with negative real part.
, where is the complex unity, and .
, “’’ is the logic disjunction, and “’’ is the logic conjunction. is the integer part of the rational quotient and for any given sets and .
, , , and denote, respectively, that the square matrix is positive definite, positive semidefinite, negative definite, and negative semidefinite.
denotes the spectrum of a real matrix (i.e., its set of distinct eigenvalues) and and if exists and , otherwise, are, respectively, the maximum and minimum singular values of , where is the conjugate transpose of . is replaced by the complex conjugate transpose of if is complex. is the maximum eigenvalue of .
is the -norm of the real or complex matrix and denotes its -matrix measure.
is the th identity matrix.
is the Kronecker product of the matrices of entries and . If is the th column of the matrix then the vectorization of the matrix is defined by .
ZOH is an acronym for a zero-order-hold device.
Assume that are system, control and output matrices of linear time-invariant systems. A switching law among the above systems is a piecewise constant function . The set of switching instants of the switching law is a strictly ordered sequence which verifies for the sake of notational abbreviation. The continuous-time switched system obtained via from the parameterizations , is where , and are, respectively, the state, input and output vectors and , , are the matrices of dynamics, control, and output for the th parameterization; for all and , and define the switched system (1.1) for the switching law .
2. Connecting a Class of Lyapunov Functions for Linear Continuous Time Systems with those of the Discretized Counterparts
The following result establishes that if a symmetric positive definite matrix defines a Lyapunov function for a linear and time-invariant system then the same matrix defines a discrete Lyapunov sequence for the discrete counterpart of such a system.
Assertion 2.1. Assume that is a stability matrix so that is a Lyapunov function of the th continuous-time linear time-invariant differential system or any given real matrix satisfying the Lyapunov matrix equation for any given real matrix . Then, defined with is a discrete-Lyapunov sequence for the discrete system for any finite sampling period .
Proof. Direct calculus yields Note that since is a stability matrix then Then, for all nonzero so that is a discrete Lyapunov sequence.
Remark 2.2. The matrix satisfying uniquely the Lyapunov matrix equation may be equivalently calculated through its entries as Note that since is a stability matrix, it is nonsingular implying that the -square matrix is also nonsingular. Furthermore, this also implies that (2.3) is uniquely solvable as expected. Equivalently the matrix can be also calculated from (2.2) for a sufficiently small-sampling period as since .
The subsequent result establishes that if the linear and time invariant system is, so-called stabilizable, namely, it is globally asymptotically stabilized by some state-feedback linear control law then it is also globally asymptotically stabilized by the piecewise constant law ; for all , for all for sufficiently small-sampling period . In other words, the discretized closed-loop system obtained through a Zero-Order-Hold (ZOH) is also globally asymptotically stable under the same controller gain for sufficiently small-sampling period.
Assertion 2.3. Assume that the pair is stabilizable. Then, for each stabilizing controller matrix (i.e., is a stability matrix, equivalently all its eigenvalues are in ) the following properties hold.(i)There exists a sufficiently small maximum sampling period such that the discrete pair is stabilizable under the same controller matrix (i.e., is a convergent matrix, for all : that is, as and, equivalently, all its eigenvalues lie in the open unit disk .(ii)Assume that the pair is stabilizable. Then, is convergent for any controller gain matrix , such that is a stability matrix, and any sampling period which satisfies . Furthermore, it always exists a first sampling period convergence interval for in the sense that is a convergent matrix, for all with provided that the set . If then .
Proof. (i) Direct calculation yields
where , depending on the matrices , , and , depending on matrices , , and , , are both bounded -real matrices and “’’ stands for Landau’s “small-’’ defined in standard way as follows. Given a real function then if , that is is Landau’s “big-’’ of (i.e., for some real constants and, furthermore, . For , the matrix (2.4) is identity so that it is critically stable. However, for , one gets from (2.4) the following inequalities by using the matrix measure :
since being a stability matrix and the properties of the matrix measure imply
Now, for any given real constant , it exists such that
Then, one gets from (2.5), (2.7a), and (2.7b) that , and is a convergent matrix; for all for some sufficiently small as it is for all , since is a stability matrix. Property (i) has been proved.
(ii) Since is a stability matrix, is a convergent matrix and then nonsingular, for all with eigenvalues within the open unity disk. By direct construction, . Thus, is nonsingular and then convergent for sufficiently small since is convergent for sufficiently small-sampling period that satisfies from Banach Perturbation lemma. Since the real function is a continuous function of the sampling period which satisfies the above constraint for since , it exists , such that is convergent, for all with , provided that . If then . Property (ii) has been proved.
Note that the first property of Assertion 2.3 is a local result about the existence of a minimum sampling period such that a continuous-time system which is closed-loop stable remains stable if it is discretized under a sufficiently small-sampling period with the same stabilizing controller. Assertion 2.3(ii) relies on a constraint which is numerically testable very easily and is useful to calculate a first admissibility interval for the sampling period such that the stability of the system still holds when using the same continuous-time stabilizing controller. Assertion 2.3 is now interpreted in practical terms of achievement of closed-loop stability of a system discretized through a ZOH sampling and hold device and the same controller gain matrix, as that of the continuous-time counterpart, provided that the sampling period is sufficiently small.
Assertion 2.4. Assume that the pair is stabilizable. Then, there exists a sufficiently small-sampling period such that all the solutions of ; for all ; for all ; for all are globally asymptotically stable for each stabilizing controller matrix .
Proof. The state trajectory solution at sampling instants (for all ) is given by for each bounded initial conditions . The pair is stabilizable if and only if it exists such that is a convergent matrix for some . Since is stabilizable, it exists such that is a stability matrix and, equivalently, is a convergent matrix, for all . For the same matrix , some real constants ; for all , for all , one gets Since the convergence abscissa of is in , for all (since is a stability matrix), . Also, the convergence abscissa of is also in (0, 1) for sufficiently small and for all . Then, is convergent, so that is stabilizable, and the discrete-time system is globally asymptotically Lyapunov stable.
Time varying sampling periods may be considered as strictly ordered sequences of positive real numbers. The sampling instants are real sequences of positive real numbers defined by , ; for all . A special case arises when each sampling period is generated as some real function of preceding sampled states and preceding sampling instants ; that is, . Assertion 2.3 extends to time-varying sampling periods as follows.
Assertions 2.5. Assume that the pair is stabilizable. Then, for each stabilizing controller matrix (i)there exists a sufficiently small maximum sampling period such that for any time-varying sampling period ; for all , the time-varying discrete pair is stabilizable under the same controller matrix (i.e., is a convergent matrix so that as and, equivalently, all its eigenvalues are in );(ii)for any sampling instant ; for all , is convergent, that is, as , for all and, equivalently, all the eigenvalues of are in
The above results rely on the well-known fact that although is a convergent matrix for any real 0 if is a stability matrix, the property does not hold for any if the system is discretized through a ZOH and the same controller gain is used within each intersample period.
3. Stability of a Class of Hybrid Switched Systems
This section considers switched hybrid systems which consist of mixed continuous-time and discrete-time (through ZOH devices and sufficiently small-sampling period) switched controls for potentially distinct continuous-time parameterizations. The stability of the hybrid switched systems is investigated by using results of the above section. The potential application of mixed continuous-time discrete-time control laws is that when discrete controls are operating, the controller is not required to acquire data at all time but only at the rate of the sampling period so that the computational costs are reduced. Another advantage might be that in the case of data validity failure, sampled data at previous time instants can replace the incorrect data for the controller operation. If hybrid continuous-time/discrete- time controlled switched systems are designed then a common Lyapunov function exists for all (continuous-time and discrete-time) parameterizations for sufficiently small-sampling period. A common Lyapunov function exists if either the matrices of dynamics of the individual parameterization commute or if the pair-wise commutators are sufficiently close to zero in terms of norms, [3, 13, 17, 25–27]. If there is no common Lyapunov function, then a minimum residence time is requested at each individual active parameterization to guarantee closed-loop stability provided that all such parameterizations are stable, [3, 17, 20–22, 25–27]. Thus, the existence of a common Lyapunov function is a hypothesis commonly used for arbitrary switching in the sense that the parameterizations switch arbitrarily (i.e., at any switching instants). However, if such an assumption does not hold, then the switched system is still globally asymptotically stable if a minimum residence time is kept at each parameterization before the next switching occurs.
Theorem 3.1. Assume that the pairs , are all stabilizable through linear state-feedback control gains of appropriate orders so that all the closed-loop systems , possess a common Lyapunov function. Then, the time-varying control law with where the discrete map is arbitrary and is defined by for any , subject to or ; for all , globally asymptotically stabilizes the switched system: for any sampling period sequence with , for all and some sufficiently small with piecewise constant matrix functions and for .
Proof. Note that for each individual of the parameterizations.(a)The continuous-time system and its discrete counterpart may be stabilized by a continuous-time controller or a discrete-time one under a ZOH for any (constant or time-varying) sufficiently small-sampling period by using the same controller gain (Assertions 2.3 and 2.4), since (b)The continuous time Lyapunov function is also a discrete Lyapunov sequence with the same matrix for the continuous-time system for any sampling period (Assertion 2.1).(c)There is a common Lyapunov function for all the parameterizations so that the controller gain may be updated with arbitrary switching. That is, it may be any of the gains at any time acting on the current state vector or during a sufficiently small-sampling period acting on the last sampled value of the state vector at a sampling instant for a sufficiently small, in general time-varying, sampling period with the current time fulfilling ; for all .
Remark 3.2. Theorem 3.1 relies on the fact that arbitrary switching related to the gain updating rule for a switched system may be done with nonconstant sampling periods for the discrete-time parameterizations. The gain updating process may be made at any time and the controller might take the current state vector as regressor. Instead the regressor may be the last sampled value of the state vector for sufficiently small (in general) time-varying sampling period. Both controller actions, namely, arbitrary controller updating (associated with arbitrary switching) and either continuous-time or discrete-time (but at sufficiently small-sampling rate) control actions may be interchanged through time. The closed-loop stability is preserved.
Theorem 3.1 applies if ; for all share a common Lyapunov function. The subsequent result gives sufficient related conditions.
Theorem 3.3. Assume that the pairs , are all stabilizable. Assume also that there exist a stability matrix and matrices ; for all such that the following constraints hold:(1) for all ;(2); for all for some where is any solution satisfying . Thus, the closed-loop systems , are all globally asymptotically stable and share a common Lyapunov function . Thus, the arbitrary switching law of Theorem 3.1 with either , or with with the sampling period being sufficiently small for all , globally asymptotically stabilizes the open-loop switched system (3.1). The result also holds if and , for all are all stability matrices and pair-wise commute.
Proof. If condition (1) holds then controller gains (being unique if the rank is ); for all exist from Kronecker-Capelli theorem such that ; for all . If a Lyapunov function candidate is used, then for are condition (2) holds provided that control law where the discrete map is arbitrary. If is defined by , then any two consecutive switching instants, either for ; for all if , or if provided that for any and is sufficiently small from Assertions 2.3 and 2.4(i). The first part of the result has been proved. The second one is direct since linear time-invariant systems whose matrices of dynamics are stability matrices which commute share a common Lyapunov function, .
The subsequent technical result is directly applicable for the case when the closed-loop switched system is generated by a switched linear output-feedback controller acting on a linear and time-invariant open-loop system.
Theorem 3.4. Consider the linear time-invariant open-loop system: where , , and , are the state, output, and control vectors, and , , are matrices of compatible orders with the dimensions of such vectors. Consider also a switched linear output-feedback control law: with a switched controller , ; for all . This leads, after injection of (3.6), to the switched closed-loop system:for then, the following properties hold.(i)The open-loop system (3.5) is output-stabilizable by a control law (3.6) if for some stability matrix .(ii)The open-loop system (3.5) is output-stabilizable by a control law (3.6) if , and and the triple is controllable and observable.
Proof. (i) If the given rank condition holds with a stability matrix then there is a solution to the matrix identity from Kronecker-Capelli theorem. Then, the resulting time-invariant closed-loop system is globally asymptotically stable. Property (i) is proved since there is a constant controller which asymptotically stabilized the closed-loop system. (ii) If and and the triple is controllable and observable then there the spectrum of may be fixed as closely as desired to any given set of (possibly repeated) complex numbers in .
A system is said to be output-stabilizable if there is a linear output-feedback law which makes the closed-loop system to be globally asymptotically stable. An extension of Theorem 3.4 for the case of linear output feedback under a set of switching controllers follows.
Theorem 3.5. Consider the linear time-invariant switched open-loop system: where , , are the state, output and control vectors, and is a switching law and ; for all , , are piecewise constant function matrices of compatible orders with the dimensions of such vectors. Consider also a switched linear output-feedback control law: with yielding after injection of (3.9) into (3.8), the switched closed-loop system: Then, the following properties hold.(i)Assume that there exists a set ; for all of stability matrices such that:(1)(2) such that ; for all . Thus, the time-invariant closed-loop systems , are all globally asymptotically stable provided that each is selected such that is a solution to the compatible linear algebraic system: Furthermore, all those systems share a common Lyapunov function . As a result, the arbitrary switching law of Theorem 3.1 with a control law (3.9) with the (potentially time-varying sampling periods) being sufficiently small for all , globally asymptotically stabilizes the open-loop switched system (3.1).(ii)The open-loop system (3.8) is output-stabilizable by a control law (3.9) if , and and the triples), for all are controllable and observable for any switching law subject to a minimum sufficiently large residence time at each active parameterization .
Outline of Proof
(i) It is a direct extension of Theorem 3.1 by using Assertions 2.3 and 2.4 since firstly the controller gains being solutions to (3.11) imply ; for all . Furthermore, ; for all implies that is a common Lyapunov function for the parameterizations so that the closed-loop system obtained from any arbitrary switching law (3.9) is globally asymptotically stable under arbitrary switching.
(ii) From Theorem 3.3(ii), the closed-loop linear time-invariant systems ; are all stable and with eigenvalues closed to prescribed sets (even if does not matchs a prescribed ; for all ) for some existing controller gains ; for all . Thus, the switched closed-loop system is globally asymptotically stable for any switching laws subject to a minimum sufficiently large residence time at each active parameterization .
4. Stability of Centralized and Decentralized Switched Linear Systems
The results of Section 3 are extended to the following class of composite open-loop switched systems: where , , and are the -state, -input, and -output vectors, and in such a way that (4.1) and (4.2) consist of interconnected composite systems of respective state, input and output , , and , that is with A state (resp., output)-feedback control law for the system (4.1)–(4.4) is said to be decentralized if has the th state (resp., output ) available for measurement but not all is available for the th controller (or, at least, some components of the substate are not available to the th for controller). If the whole (resp., ) is available for each ; for all then the control law is said to be a centralized control law. Decentralized state-feedback (resp., output feedback) control has important applications. The main reason is that it allows the control of several interconnected subsystems with a partial state (resp., output) information, [28, 29]. This is very useful when the individual systems are physically separated. A practical example is a group of separated electric power production stations operating as a tandem group located in the same river. Another application is the reduction of computational costs as a result of minimizing the shared information by a group of local controllers. A new open possibility of switched decentralized control is to eliminate crossed information for the individual controllers depending on each particular active parameterization. A linear state-feedback controller for the switched system (4.1)–(4.4) is where the controller gain is piecewise constant governed by the switching law A centralized control law is defined by matrices () whose entries can be all nonzero. A decentralized control law is defined by those matrices in such a way that at least a nondiagonal entry per row is necessarily zero; that is, some component of the substate is not available for the substate for each ; for all . To simplify the subsequent discussion, any decentralized control law is assumed to be constrained to have at least a nondiagonal block identically zero, that is, for at least a , depending in general on and ; for all , for all . The substitution of (4.5)-(4.6) into (4.1)–(4.4) leads to the following closed-loop system: To distinguish centralized and decentralized control laws, subscripts “’’ and “’’ are used in (4.7) as follows: is the closed-loop system (4.7) under centralized control, and is the closed-loop system (4.7) under decentralized control, where Note from (4.9)-(4.10) that where (4.14) is well posed if exists, and in particular, if it is a stability matrix for all . The small gain theorem  yields the following direct result from (4.13).
Proposition 4.1. Assume that the matrices are all stability matrices, for all . Thus, are stability matrices, for all if ; for all which is guaranteed if ; for all . The last condition is guaranteed in terms of singular values if ; for all .
Proposition 4.1 guarantees the stability of all the individual parameterizations of the switched system under decentralized control. It is assumed that all of them are stable under centralized control and the deviation of the decentralized controller gains with respect to the stabilizing centralized ones are sufficiently small. Such a “smallness’’ is quantified in terms of testable conditions obtained by evaluating matrix norms. Note that the “a priori’’ necessary condition for the existence of matrices for stabilization of the th open-loop system parameterization through some continuous-time centralized controller is that the pair be stabilizable, namely, ; for all (Popov-Belevitch-Hautus rank stabilizability test). Equivalently, all the uncontrollable modes, if any, have to be stable. The following extension of Proposition 4.1 is direct.
Proposition 4.2. Assume that the matrices are all stability matrices, for all with common guaranteed stability abscissa , that is, (if the left-hand side corresponds to an eigenvalue with multiplicity one then . Thus, are stability matrices, for all with common guaranteed stability abscissa , that is, if provided that
Proof. It has to be proved that is a stability matrix; for all provided that is a stability matrix; for all . Direct calculations yield which is a stability matrix from the small gain theorem if is a stability matrix and ; for all which is guaranteed by (4.15) and (4.16).
The interpretations of Propositions 4.1-4.2 are directed as follows. Assume that the centralized control law stabilizes the th parameterization. Then, a sufficiently small satisfying (4.15) (or its counterpart in Proposition 4.1) and a tradeoff between stability abscissas, see (4.16), guarantee that the decentralized controller gain (4.10) stabilizes the th parameterization of the switched system. However, it is required for the off-diagonal blocks of a stabilizing centralized controller gain to have sufficiently small norms. This allows their removal from the decentralized gain while guaranteeing closed-loop stabilization of each particular parameterization. An alternative useful approach in practice is to give conditions for decentralized stabilization and then either to remove the off-diagonal blocks of the centralized controller gain (then, the controller is a decentralized one) or to use some of them to increase the robustness against an increasing of the coupling effects between the various subsystems, evaluated in terms of increasing norms of the corresponding off-diagonal entries of the matrix of dynamics of the open-loop system. To formulate these issues more precisely, suppose a block diagonal structure for the decentralized controller gain where ; for all , for all . It is now assumed that some of the parameterizations of the switched system are stabilizable through a purely diagonal decentralized controller gain. The following technical assumption is then needed.
Assumption 4.3. The pairs are stabilizable; some , for all , for all .
Proposition 4.4. If Assumption 4.3 holds then there exists a purely decentralized controller, given by a block diagonal controller gain (4.18), such that the closed-loop th parameterization is globally asymptotically stable. The matrix of the closed-loop dynamics is a stability matrix satisfying ; for all ; for all , provided that where , and ; for all .
Note that the norm constraint in Proposition 4.4 refers to the sufficiently norm smallness of the off-diagonal dynamics in order to achieve decentralized stabilization. It is now assumed that the rest of the parameterizations are stabilizable under a centralized controller as follows.
Assumption 4.5. The pairs are stabilizable, some , for all .
Proposition 4.6. The following properties hold.(i)If Assumption 4.5 holds then there exists a centralized controller of gain ; for all such that the closed-loop th parameterization is globally asymptotically stable. The matrix of the closed-loop dynamics is a stability matrix satisfying ; for all ; for all ,(ii)Assume that the centralized controller gain is replaced with a (at least partially) decentralized one such has some zero off-diagonal entries and The matrix of the closed-loop dynamics is a stability matrix satisfying ; for all ; for all .
Assumption 4.7 s. The pairs are controllable for all , for all and the pairs are also controllable for all . In other words, such that where is a stability matrix with arbitrary finite stability abscissa ; for all , for all ; and where is a stability matrix with arbitrary stability abscissa ; for all .
Note that, since controllability is equivalent to arbitrary pole-placement via linear state feedback (and then implies stabilizability) Propositions 4.4–4.6 are also fulfilled under Assumptions 4.7. The first main result of this section follows.
Theorem 4.8. The following properties hold.(i)The closed-loop switched system obtained from the open-loop system (4.1)–(4.4) with the linear state-feedback controller (4.5)-(4.6) is globally asymptotically stable with stability abscissa equal to or less than (but then arbitrarily close to) if(1)Assumptions 4.7 hold,(2)the switched controller gain (4.6) of the mixed decentralized/centralized switched system is calculated as a solution of the linear algebraic compatible systems below:(3)the switching law generates a set of switching instants subject to a sufficiently large minimum residence time at each current active parameterization ; for all , for any two consecutive .If, furthermore, , , and ; for all , for all , for all then Assumptions 4.7 hold with full column ranks in both rank identities so that the controller gains being solutions to (4.23)-(4.24) are then unique.(ii)If Proposition 4.6(ii) holds then Property (i) is still valid with a purely decentralized controller for the parameterizations and a partly decentralized one for the parameterizations by replacing the algebraic system of equations (4.24) by such that such satisfies (4.20) while having some zero off-diagonal entry(entries); for all with (4.25) being solved as a companion one to (4.23).
Note that the switching control law used in Theorem is not arbitrary since a minimum residence time has to be kept at each active parameterization. Note also that the use of compatible algebraic systems to calculate the controller gain entries exceeds the requirement of closed-loop stabilization, under open-loop stabilizability, since in this case it is only requested to re-allocate the closed-loop poles in the stable region via state feedback. The statement of an algebraic system is made for illustration purposes with the topic of centralized/decentralized control for a system decomposed into subsystems. If the problem were focused for the whole open-loop system (without its decomposition into coupled subsystems) then the algebraic system (4.24) can be used for all parameterizations (in a centralized control context) as fully equivalent to the closed-loop stabilizability problem. In this context, assume that Theorem 4.8 is restricted to a centralized control law with both the open-loop matrices of dynamics and the controller gains being in companion form for the parameterizations. Thus, the algebraic problem solved is equivalent to closed-loop stabilization with prescribed pole-placement for each parameterization of the switched system. The closed-loop modes of each parameterization match the eigenvalues of the corresponding closed-loop matrix of dynamics ; for all . The second main result of this section is concerned with arbitrary switching under pair-wise commutation properties of all the matrices ; for all or its sufficient closeness in terms of sufficiently small norms of all the pair-wise error matrices.
Theorem 4.9. The following properties hold.(i)The controller gains calculated from the mixed decentralized/centralized control law (4.23)-(4.24) globally asymptotically stabilize the switched closed-loop system for any arbitrary switching law (i.e., without requiring a minimum residence time at each active parameterization) provided that (1)the closed-loop matrices of dynamics of all the individual parameterizations are all stability matrices;(2)those matrices are sufficiently close to each other in terms of smallness of the corresponding norm errors.(ii)Assume that (for all ) are all stability matrices which commute pair-wise; that is, they have zero commutators ; for all . Thus, the closed-loop switched system is globally asymptotically Lyapunov's stable.
Proof. (i) Consider a common Lyapunov function candidate for some for the closed-loop switched system (4.1)–(4.6) whose time derivative is for all nonzero if for some matrix function . Choose a piecewise constant if . Define matrix increments: Equation (4.27) holds if for any and ; for all since ; for all ; for all . Thus, (4.27) holds, and then the switched system is globally asymptotically stable since it possesses a common Lyapunov function for all its parameterizations from (4.26), if the constraints below hold: with ; since is a stability matrixv equations (4.29)-(4.30) imply that are stability matrices; for all . Equation (4.30) holds if where for some such that the -semigroup of infinitesimal generator is exponentially stable satisfying ; for all . Note from (4.23)-(4.24) that if and are first calculated for one of the parameterizations then the remaining gains are calculated from Theorem 4.8 as respective incremental gains from the subsequent nested algebraic sets of systems as follows: some , for all , for all ; and provided that such algebraic systems are algebraically compatible, that is, the following rank conditions hold (Kronecker-Capelli theorem):(1) for some , for all ,(2) for some , for all , for all ,(3), (4)From (4.32)–(4.34), the solution giving the incremental gains vary continuously with respect to the increments of the dynamics and control matrices of the open-loop system. Thus, for any arbitrary , there exist constants , depending on and which decrease monotonically with , such that ; for all , and provided that ; for all . Then, is a Lyapunov function, since it is a common Lyapunov function for all its parameterizations, for is sufficiently small, so that are also sufficiently small, and is subject to (then implying that ) for some chosen