Mathematical Problems in Engineering

Volume 2017, Article ID 4840859, 8 pages

https://doi.org/10.1155/2017/4840859

## Stabilization of Continuous-Time Random Switching Systems via a Fault-Tolerant Controller

School of Information and Control Engineering, Liaoning Shihua University, Fushun, Liaoning 113001, China

Correspondence should be addressed to Guoliang Wang; moc.nuyila@gnawgnailg

Received 18 February 2017; Accepted 13 March 2017; Published 20 March 2017

Academic Editor: Mohammad D. Aliyu

Copyright © 2017 Guoliang Wang and Zhiqiang Li. 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.

#### Abstract

This paper focuses on the stabilization problem of continuous-time random switching systems via exploiting a fault-tolerant controller, where the dwell time of each subsystem consists of a fixed part and random part. It is known from the traditional design methods that the computational complexity of LMIs related to the quantity of fault combination is very large; particularly system dimension or amount of subsystems is large. In order to reduce the number of the used fault combinations, new sufficient LMI conditions for designing such a controller are established by a robust approach, which are fault-free and could be solved directly. Moreover, the fault-tolerant stabilization realized by a mode-independent controller is considered and suitably applied to a practical case without mode information. Finally, a numerical example is used to demonstrate the effectiveness and superiority of the proposed methods.

#### 1. Introduction

As we know, Markovian jump system (MJS) is a particular kind of hybrid systems, which contains two parts of mechanism. One mechanism is related to system state over time, and another mechanism is named to operation mode and derived from the finite set of discrete time Markov jump parameters. Because of experiencing random characteristics, Markovian jump system is greatly suitable to describe many practical systems whose parameters or structures change abruptly, such as [1–3]. In the past few years, a lot of topics on many kinds of MJSs have been widely studied, such as stability analysis [4–7], stabilization [8–11], control and filtering [12–14], output control [15–17], adaptive control [18–20], synchronization [21, 22], and robust control [23–26].

On the other hand, any system is inevitable to have faults in practice. It is necessary and meaningful to study the related problems of system experiencing faults. Fault-tolerant control problem [27–29] is when the faults of actuator, sensor, or internal component occur, the closed-system is still stable and has ideal characteristics. It is known that the classical fault-tolerant control methods may be divided into two categories: passive and active fault-tolerant control methods. Passive fault-tolerant control method is to use a fixed controller which ensures the closed-loop system insensitive to some specific faults. In other words, it could maintain the system stable. Therefore, this strategy is similar to the robust control technique [30, 31]. On the contrary, active fault-tolerant control method needs to reconstruct the controller design and reschedule the control law. In other words, according to the characteristics of expectation, we need to design a new control system after the faults occurred [32, 33]. Compared with the active fault-tolerant control method, the passive fault-tolerant control method does not need the real-time fault information or adjust the structure of controller online. In this sense, it is said that passive fault-tolerant control method is relatively simple to implement. When the underlying system is referred to Markovian jump system, some results about fault-tolerant control were given in [34–36]. By investigating such references, it is seen that the considered problems and studied methods between such cited references and this paper are quite different. Firstly, the considered system is different from the traditional Markovian jump system, where the dwell time considered here consists of a fixed part and random part. Secondly, the fault considered here is described by using a binary structured uncertainty rather than that simply described by a vector in some existing references. In fact, this structure is more clear to describe the fault. Compared with the traditional methods dealing with the fault, the method to be presented has a better relaxation and is more applicable. Thirdly, but not the last, because of the fault of controller described by a binary structured uncertainty, the quantity of fault combination will be very large and have large computation complexity. Moreover, due to the fixed and random dwell time contained simultaneously, how to make the existence conditions for such a fault-tolerant controller within LMI framework and have a concise form are also necessarily studied. It is said that the abovementioned problems not only are important in theory, but also have practical applications. For example, from [37], it was shown that the helicopter system could be modeled as an Markovian jump system, whose dynamic characteristics are clearly described by a Markov chain with three different states according to airspeeds of 135 (nominal value), 60, and 170 knots. Moreover, the helicopter system is also inevitable to have kinds of faults due to the internal components faults happening or the external environment changing in practice. In order to guarantee it still works when these faults occur, a better and necessary scheme is to design an effective fault-tolerant controller. On the other hand, though the switching of helicopter among such three modes satisfies a Markov process, it is more reasonable that each subsystem is likely to hold for a period of time. In other words, there will be a fixed and random dwell time in each subsystem. Finally, but not the last, it is also important that the desired control method should be with less computation complexity and easily realized. Based on these explanations, it is said that it is significative to design a fault-tolerant controller for Markovian jump systems experiencing forced dwell time and also has practical significance. To the best of our knowledge, very few results are available to design fault-tolerant controller for random switching system. All the facts motivate the current research.

In this paper, the stabilization problem of continuous-time random switching systems closed by a fault-tolerant controller will be studied, whose conditions are presented in terms of LMIs and without any fault. The main contributions of this paper are summarized as follows: (1) A kind of fault-tolerant controller is proposed to stabilize a continuous-time random switching system which contains fixed and random dwell time simultaneously, whose conditions are obtained by exploiting a robust method; (2) the sufficient conditions for the desired controller are presented with LMI forms and fault-free, which could be solved directly; (3) due to the results without any fault, the complexity of computation will be smaller than ones obtained by the traditional methods; (4) because of the given conditions being LMIs, the existence conditions for fault-tolerant controller without any mode operation are obtained easily.

*Notation*. denotes the -dimensional Euclidean space; is the set of all real matrices. refers to the Euclidean vector norm or spectral matrix norm. is the sample space, is the -algebras of subsets of the sample space, and is the probability measure on . In symmetric block matrices, we use “” as an ellipsis for the terms induced by symmetry, for a block-diagonal matrix, and .

#### 2. Problem Formulation

Consider a class of switched linear systems defined on a complete probability space and described aswhere is the system state vector, indicates the control input vector, and represents the switching signal and determines the current system operation mode. For any , and are known matrices of compatible dimensions. Time instant represents the current operation mode of the system to another operation mode. The parameter represents a fixed dwell time of system (1) with mode . If the system occurs to interval , where there is no switching, it will surely followwhere represents a very short amount of time and satisfies . For the time interval , if , at this time the mode switching follows the mode transition probabilities with TRM given bywhere , , if , and .

In this paper, the designed state feedback controller may have faults, which is referred to be a fault-tolerant controller (FTC) and described bywhere is the control gain to be determined. The parameter is a diagonal matrix and used to describe the controller fault happening or not. Its form is defined asParticularly, we could clearly find that if there are no faults. It is seen that there are possible combinations representing the controller faults. Equivalently, has elements. Then, the resulting closed-loop system is rewritten to bewhere .

*Remark 1. *It is worth mentioning that the fault of controller (4) is described by a binary structured uncertainty. Compared with some existing references [27, 31, 32, 34–36] where the fault is modeled to be a vector, this formulation has a better description and more application scope. However, it is also seen that possible combinations are included to represent the controller faults. This will make the computation complexity very large; in particular the underlying system is a switching system with operation modes. Thus, how to reduce the complexity and make the obtained results with concise and easily solvable forms are necessary and meaningful problems.

Lemma 2 (see [4]). *System (1) without any control is stochastically stable if and only if there exists matrix , , such that*

Lemma 3 (see [33]). *Let , , , and be given matrices with appropriate dimensions, where and . Define , , where and should be satisfied. Consider the following inequality holds for any , if there exist matrices and such thatwhere and satisfied .*

#### 3. Main Results

Theorem 4. *For given system (1), there exists an FTC (4) such that the resulting close-loop system (6) is stochastically stable, if for given scalars and , there exist matrices , , and , such thatwhere Thus, the gain of controller (4) is computed as*

*Proof. *Replacing with in (7), it is clearly known from Lemma 2 that the resulting closed-loop system is stochastically stable if the following condition isIt is further guaranteed byFor any matrix , , it is claimed that . Then, it is obtained thatBy pre- and postmultiplying (18) with , it is get thatBased on Lemma 3, it is known that conditions (10), (11), and (12) imply the following conditions, respectively. That is,where where where Because of in addition to and , it is concluded that and . Based on (20) and (22), one getsFrom condition (13), we haveimplyingBy considering representation (15), (25) is equivalent toThen, it is obtained thatIt is further derived thatThen, we getBased on this, condition (19) is guaranteed bywhich could be implied by condition (12). This completes the proof.

*Remark 5. *As for stability problem, [4] firstly presented a necessary and sufficient condition. However, when the system synthesis problems such as stabilization are mentioned, there are few results available. The main reason is that some nonlinear terms will be inevitably encountered, which are not handled easily and directly. From the proof of Theorem 4, such nonlinear terms encountered in condition (7) have been done suitably. Though the large quantity of fault combination, fixed, and random dwell time are included, sufficient existence conditions for fault-tolerant controller (4) are given in terms of LMIs, which are more general than ones in [38]. Moreover, the established conditions are fault-free. In other words, instead of combinations involved, only two special cases of no fault and all fault are taken into account, which are fewer than ones in [39–41]. Based on these facts, it is said that the conditions given in this theorem have small computation complexity and could be solved directly and easily.

From Theorem 4, it is seen that the desired controller (4) is mode-dependent and needs its operation mode available online. It is very known that this assumption will be limited in some practical applications. In order to deal with the general condition, a mode-independent controller is usually designed and described aswhere is the common control gain to be determined.

Theorem 6. *For given system (1), there exists a mode-independent FTC (33) such that the resulting system is stochastically stable, if for given scalars , and , there exist matrices , , , and satisfying (13) andwhere The other variables are given in Theorem 4. Then, the gain of controller (33) is computed by*

*Proof. *Similar to the proof of Theorem 4, it is concluded that conditions (34)–(36) could implywhere where where Without loss of generality, we only consider (43) in detail. By using Lemma 3 and the Schur complement lemma, it is got that the following conditionis guaranteed by condition (43). Moreover, it is concluded from (36) that matrix is nonsingular. Based on representation (38), it is claimed thatwhere is implied by pre- and postmultiplying both sides of (45) with and its transpose, respectively. The next is similar to the proof of (32). On the other hand, as for conditions (39) and (41), it is concluded that they can imply conditions (20) and (22) by pre- and postmultiplying both sides with and , respectively. The next steps are similar to the ones in Theorem 4. This completes the proof.

*Remark 7. *In order to deal with the mode-independent control problem, a simple and direct way is to select a common Lyapunov function for all modes. Though the gain of controller or filter could be get without any mode information, the choice of mode-independent Lyapunov function usually brings larger conservatism, which may make the design of mode-independent controller fail. In this case, a better way is to make the requirements of mode-independent controller and mode-dependent Lyapunov function be satisfied simultaneously. From Theorem 6, it is seen that such requirements could be satisfied well by letting mode-dependent matrix and common matrix . In other words, the conservatism of the obtained results could be reduced, while the goal of mode-independent control could also be achieved.

#### 4. Numerical Examples

*Example 1. *Consider a continuous-time random switching system of form (1) with , whose parameters are described as follows: The transition rate matrix is given asWithout loss of generality, the fixed dwell time of such two subsystems is assumed to be and , respectively. As for this example, one could design a stabilizing controller by solving a set of LMIs. In this section, we will compare two types of controller: the standard mode-dependent controller (“” as the subscript, “” as the superscript) and the mode-dependent fault-tolerant controller (“FTC” as the subscript, “” as the superscript). Particularly, the existence conditions of such two controllers are both LMIs, which are described in conditions (20), (22), (23), and (25) with and conditions in Theorem 4, respectively. By Theorem 4 with , , , and , we have the gains of the mode-dependent fault-tolerant controller (4) computed as The gains of standard mode-dependent controller are given as which are similar to the ones in [38]. After applying the above controllers, respectively, the stability effects of the resulting closed-loop system are given in Table 1. Here, four types of fault combinations are contained in . In this table, “” represents the stable closed-loop system, while “” denotes that the closed-loop system is unstable. Since the above standard mode-dependent controller is without considering faults, the resulting closed-loop system will be unstable for two types of fault combinations. To the contrary, the resulting system closed by the designed mode-dependent fault-tolerant controller (FTC) is always stable. Moreover, though the existence conditions for the desired fault-tolerant controller are within LMI framework, only two special cases of complete fault and no fault are taken into account. Instead of four types of fault combinations involved such as [39–41], the complexity of computation could be reduced; particularly system dimension or amount of subsystems is large. Even for a simple case that system dimension and number of subsystems , there will be 4 fault combinations, where the amount of LMIs is 8. In other words, the amount of the fault combinations or system dimension in addition to quantity of operation mode has a very large influence on the complexity of the calculation. Under the initial condition , the state response of the resulting closed-loop system by the standard mode-dependent controller is given in Figure 1(b), while Figure 1(a) is simulation of operation mode. From this simulation, it is said that the fault of controller plays a negative effect to system and could make the system unstable. To the contrary, after applying the above mode-dependent fault-tolerant controller, one could get the state response given in Figure 2. It is obvious that the resulting closed-loop system is stable though there are faults in the desired controller. Moreover, when system mode is unavailable, a kind of mode-independent fault-tolerant controller (33) could be designed by Theorem 6, and its gain is computed as The corresponding matrices of Lyapunov function are computed as It is seen that the obtained controller is mode-independent, while the corresponding Lyapunov function is mode-dependent. Because of this, without selecting a common Lyapunov function, the solvable set of mode-independent controller will be larger. Thus, the results will be less conservative than the ones obtained by mode-independent Lyapunov functions. Under the same fault combinations and the initial condition, we could obtain the state response of the resulting closed-loop system given in Figure 3 and stable too. Based on these simulations, it is said that our methods based on fault-tolerant controller are superior to ones without considering faults.