Research Article | Open Access

# Predictive Control for Interval Type-2 Fuzzy System with Event-Triggered Scheme

**Academic Editor:**Antonin DvorÃ¡k

#### Abstract

In this paper, a synthesis approach of model predictive control (MPC) is proposed for interval type-2 (IT2) Takagi-Sugeno (T-S) fuzzy system with quantization error, bounded disturbance, and data loss. The novelty lies in the following technical improvements. In order to reduce the redundant data transmission, an event-triggered communication scheme is applied to determine whether the control law should be transmitted into the communication network or not. The IT2 T-S fuzzy model is utilized to address the nonlinearity of plant with parameter uncertainties, which can be captured by the lower and upper membership functions. Furthermore, the phenomena of data loss and quantization error between the controller and the actuator are expressed as Markovian chain and sector-bound uncertainties. The synthesis approach of MPC is provided by solving an MPC optimization problem over an infinite horizon objective function which explicitly considers the input constraints. By applying the quadratic boundedness (QB) technique, the recursive feasibility and quadratic stability of closed-loop system can be guaranteed. A numerical simulation and comparison studies are proposed to illustrate the effectiveness of this approach.

#### 1. Introduction

The networked control systems (NCSs) have played a more and more important role in many areas, which depend on the convenience of communication networks, such as low cost, simple installation and maintenance, and reduced system wiring [1â€“4]. However, communication networks also bring some challenges to the corresponding control system. The main problems are data loss and quantization error, which may degrade the control performance of NCSs. Caused by the limited capacities of communication networks, the signals always should be quantized before being transmitted into the network. Beyond that, owing to the unreliable features of communication networks, the data may be lost. Thus, the control performance of NCSs will be degraded by the quantization error and data loss inevitably. Many nice works about addressing data loss and quantization error problems under the framework of linear system theory are proposed in the past decades; see, e.g., [5â€“7].

Recently, the nonlinear characteristics of the NCSs have attracted a lot of attention owing to their practical applications. Takagi-Sugeno (T-S) fuzzy model is a popular method to address the nonlinearity of the NCSs, which bridges the gap between the complex nonlinear systems and linear systems [8]. Almost all the smooth nonlinear systems can be converted into linear systems by using T-S fuzzy model. Reference [9] proposed a new quadratic stabilization condition for the T-S fuzzy system, which based on the linear matrix inequalities (LMIs) technique. Reference [10] designed a method to address stability analysis and stabilization problems for the continuous T-S fuzzy system with time-delay. In [11], a new adaptive terminal sliding mode control method for single-input multi-output T-S fuzzy system with unknown and external disturbance was investigated. It is worth mentioned that there exist no uncertainties in the membership functions for the type-1 T-S fuzzy system; thus, the above researches based on the type-1 T-S fuzzy model may result in conservatism. To our delight, the IT2 T-S fuzzy model is imposed to deal with the parameter uncertainties of nonlinear systems captured by the lower and upper membership function [12â€“15]. In many aspects, IT2 T-S fuzzy model has better performance than the type-1 T-S model, which can be approved by some applications, such as DC-DC converters [5], autonomous mobile robot [6], airplane flight control [16], and aerospace theory [17]. Moreover, many nice works have begun to design and analyze IT2 T-S fuzzy systems under network environment. In [18], the parameter uncertain in nonlinear networked control systems was described as lower and upper membership functions and relative weighting functions; furthermore, the phenomenon of data loss also has been taken into account. Reference [19] proposed an IT2 T-S fuzzy filter for nonlinear NCSs with data loss and quantization; beyond that, stochastic stability with performance can be guaranteed.

In NCSs, we often exploit time-triggered scheme; however, by this way, almost all data will be transmitted into the network in spite of whether the data is necessary or not. It is obvious that time-triggered scheme will reduce the efficiency of communication resources; see, e.g., [7, 20]. Event-triggered scheme can solve this problem well, which defined a trigger condition to determine whether the data should be transmitted into the network or not. By using this scheme, the burden of the network will be reduced effectively. In [21], an event-triggered communication scheme was exploited to decide whether the data should be transmitted to the controller and achieve better utilization of network resources. In [22], by applying the event-triggered communication scheme and time-triggered periodic communication scheme for T-S fuzzy NCSs, respectively, it proved that the event-triggered scheme would utilize fewer communication resources while preserving the desired control performance. In [23], it considered the networked nonlinear systems with imperfect premise matching, which alleviated the burden of communication networks by using the event-triggered scheme. Reference [24] constructed a fuzzy observer with the imperfect premise matching to estimate the unmeasurable states of networked T-S fuzzy systems and addressed the problem of an event-triggered nonparallel distribution compensation control to achieve higher communication efficiency and less conservation. It is apparently that the above results show the great advantages of event-triggered scheme. However, the state constraints and input constraints also exist in practical NCSs and have not been taken into account.

Model predictive control (MPC) is widely applied in industrial and academic communities since the defining feature of handling the physical constraints in a systematic manner [25â€“28]. At each sampling time, MPC is to solve a finite horizon optimization control problem based on the current measurements in order to obtain an optimal control sequence; however, only the first control of the optimal sequence is implemented. In the past decades, a great deal of researches [29â€“32] are based on the different branches of it, which have facilitated the development of this advanced method. Deserved to be mentioned, the synthesis approaches of MPC, as the important part of MPC, have attracted much attention and made some representative achievements; see [33, 34]. Reference [33] proposed a novelty method for linear NCSs based on the classical synthesis approach of MPC, which specified the recursive feasibility and closed-loop stability; both of data loss and quantization error problems are considered in the transmission links. Reference [34] investigated the synthesis approach of MPC for the stochastic system by describing the data loss as Markovian model and the quantization error as bound uncertainties, which guaranteed the mean square stability and recursive feasibility simultaneously. However, neither of them considered releasing the burden of communication networks by using event-triggered scheme.

In this paper, we discuss the synthesis approach of MPC for IT2 T-S fuzzy NCSs via event-triggered scheme. The controller output should be quantized before it is transmitted into the unreliable network, and the phenomenon of data loss and quantization error is taken into consideration simultaneously. In order to reduce the burden of communication networks, an event-triggered scheme is applied to decide whether the data should be released into the network or not. And in the transmission of triggered data, data loss and quantization error are expressed as Markovian chain and bound uncertain, respectively. An online MPC optimization problem that minimizes the upper bound of a quadratic objective function in an infinite time horizon subject to input constraints is proposed via the linear matrix inequality technique. Further, the recursive feasibility and closed-loop stability also can be guaranteed.

*Notation*. Throughout this paper, is an identity matrix with appropriate dimensions. represents which is a real symmetric and positive-definite (semidefinite) matrix. . In block symmetric matrices, the symbol is used to represent a term that is induced by symmetric and diag stands for block-diagonal matrix. denotes the ellipsoid associated with the symmetric positive-definite matrix . Co denotes the convex combination of elements in , with the scalar combining coefficients nonnegative and their sum equal to 1. The notation denotes future state of at time . is the expectation operator.

#### 2. Problem Formulation

##### 2.1. IT2 T-S Fuzzy Model and Controller

Consider a discrete-time IT2 T-S fuzzy model, with th rules. It can be described as follows.

*Plant Rule *. IF is is and and is , THENwhere represents the IT2 T-S fuzzy set of the function , . is the state variable, is the input vector, is the persistent disturbance, and satisfied and are constant matrices of appropriate dimensions. The firing strength of the th rule can be replaced by an interval sets as follows: , where , and , which, respectively, denote the lower and upper grades of membership, and . Then, the IT2 T-S fuzzy model is inferred as follows:where and ,â€‰â€‰, and ; both are nonlinear and satisfying .

The IT2 T-S fuzzy controller with rules is denoted as follows:* Controller Rule *: IF is is and and is , THEN:where is the IT2 T-S fuzzy set of the function , . is the feedback control law, and is the controller output. The firing strength of the th rule can be replaced by interval sets as follows: , where and , which, respectively, denote the lower and upper grades of membership, and . Then, the IT2 T-S fuzzy model is inferred as follows:where , and , and , both are nonlinear and satisfying .

Moreover, hard constraints are always caused by physical constraints and imposed on the manipulated variables, which can be written as follows:

##### 2.2. Event-Triggered Communication Scheme

We focus on the system controller output data transmitted over a communication network. Figure 1 shows the framework of NCSs. In order to save the limited communication resource, an event-triggered scheme is exploited to decide whether the data will be transmitted into network or not, i.e., comparing the current data with the last released data to determine whether should be released. Define the error between the current data and the last released data as , where the is the current time, is the last event-triggered time, and is the next event-triggered time. In trigger time, , where represents the ignored data between and . If the event-triggered condition can be satisfied, the data will be transmitted into the unreliable network and become a new latest event-triggered data; else, the last released data will be maintained and the current data will be ignored. The next event-triggered condition is inferred aswhere is given scalar and ; is a positive-definite matrix with appropriate dimension. We define two sequence and to describe the event-triggered scheme more specifically. The is the sequence of controller output and is the event-triggered sequence. It is apparent that , if all the data are triggered, .

When the data is transmitted into the unreliable network, the data loss from the controller to the actuator occurs inevitably. We define a stochastic variable to denote the state of time , means data is transmitted successfully, and means missing data. It is assumed that the phenomenon of data loss satisfies a discrete-time homogeneous Markov chain. The data recovery probability and the data loss probability are and , respectively, where and . The corresponding transition probability matrix is defined as follows:

It is obvious that only the event-triggered data will be lost in the network, which means data will be lost in sequence . A compensation strategy is proposed to resolve the problems of missing data. If the data are transmitted successfully, . If the data are missed, and is the last released data at time , where the is a forgetting factor. We assume that the upper of the data loss is . For further processing and simplifying the exposition, we define ; the sequence received by the buffer is

Due to the effectiveness of the buffer and , the output of the buffer is denoted as Thus, we define a new random sequence to represent the data received by the actuator Therefore, we can concluded Considering , we have . Then, we can obtain

*Remark 1. *In order to avoid the particularity, it is assumed that is triggered; i.e., . It is worth mentioning that the is inversely proportional to the event-triggered frequency.

*Remark 2. *The forgetting factor is changeable so that it can compensate for the data loss better. When the , it means no compensation, which also represents the zero-input between the controller to the actuator when the data loss occurs. means the latest transmitted successfully data will be transmitted into the actuator when the current data is lost.

##### 2.3. Quantization Scheme

The quantizer model has the following form:where denotes the scalar input under the logarithmic quantizer condition, which can be inferred aswhere The quantized level is described as . Every quantization level corresponds to a segment of so that the quantizer can maps the whole segment of . A research [35] proposed a sector-bound approach, which represented the every value of by , where . In this paper, can be choose as , so the control input from the quantizer can be written aswhere is a diagonal matrix, which consists of or .

Based on (2), (4), (9), and (12), the closed-loop dynamic model (4) can be written as follows:

Then, let , according to the (13) and (14), the augmented model is denoted aswhere ,

*Remark 3. *Consider the multiple data loss; if continuous data loss occurred times, , .

If the closed-loop system in every initial state satisfies , then we can consider the system is stochastically stable.

#### 3. Main Results

##### 3.1. Event-Triggered State-Feedback MPC

In this part, a novel event-triggered constrained MPC for IT2 T-S fuzzy system with Markovian data loss method is developed. Define the performance objective function as , with suitable dimension, and follow quadratic Lyapunov functionwhere and are positive-definite matrix. . For further discussion, we introduce the Lemma 4, which also can called QB technique. This method is applied to deal with the state estimation and bounded disturbance problems.

Lemma 4 . (see [36] ). *For all allowable , system (11) is quadratically bounded if *(i)* is Lyapunov matrix;*(ii)* implies that ;*(iii)*the ellipsoid is a positively invariant set.** The target is to design a state-feedback model predictive controller to solve the following optimization problem at each time :Assume , then, summing (20) from to , we can obtain . Thus, the optimization problem is to minimize the upper in each step time . The MPC optimization problem can be solved indirectly, which is noted asDeserved to be mentioned, whether the data is lost or not, we can assume the at time can be transmitted. Therefore, we can obtain ; by Schur complement we havewhere **Then, the optimization problem with LMIs constraints will be shown as follows.*

Theorem 5. *Condition (19) and (20) can be satisfied under condition (25)-(28), if there exist scalars , matrices , and symmetric matrices satisfying the following conditions, where . For simplicity, for a matrices , , where ,*

*Proof. *Since , thus, we have is equivalent to . Consider the event-triggered condition (10); when , according the features of event-triggered scheme, we can obtain . Then we have the following form to satisfy condition (20)Combining augmented closed-loop system (15) then we can obtain where Applying the S-procedure, (15) is satisfied for any possible and , if and only if there exists a scalar , such that Consider the and , then we have the following inequalities:where By pre- and postmultiplying and and its transpose on both sides of (28) and (27), respectively, and then, by applying Schur complement, we can obtain (23) and (24). When , using the similar approach we can get (25) and (26). If (27) and (28) hold, (20) can be satisfied apparently.

Theorem 6. *Assuming the data transmitted successfully at time , then at next time , if the data is lost in transitions, according to the compensation strategy, it is obvious that the input constraints (5) are satisfied. But, when the data is transmitted successfully, we need to guarantee the invariant set condition (22). In fact, the invariant set condition can be satisfied if there exist symmetric matrices , satisfying the following conditions, where .where *

*Proof. *Assuming the data transmitted successfully at time , the data can be transmitted from the controller to the actuator successfully. At time , if the data lost, that is , constraints (5) can be satisfied obviously; thus, the only case that should be analyzed is . From the augmented closed-loop system (15), we can obtain that is, is satisfied either. At time , there are two cases which should be considered. Case 1: ; by applying (37), that is easy to be concluded . Case 2: ; assume . By using the same method as above, it is obvious that LMIs (38) and (39) can guarantee the following inequalities, respectively, which means . At time , applying the similar approach, (37)-(40) guaranteed .

Theorem 7. *The hard constraints (5) can be guaranteed if the following LMIs exist:where *

*Proof. *The hard constraints (5) can be written as Then, at time , if data loss occurs, constraints (5) can be satisfied apparently. When the data is transmitted successfully at time , by exploiting Theorem 5, thus, we can obtainwhere is a j-column matrix that is selected from the m-dimensional identity matrix. By using Schur complement, then (44) can be obtained.

Based on the above discussion, we have the following whole constrained predictive control optimization problem:In summary, Algorithm 1 concludes the completed procedure of proposed method as Figure 2.

##### 3.2. Recursive Feasibility and Stochastic Stability of MPC

Theorem 8. *For augmented closed-loop system (17) controlled by state-feedback MPC, if the optimization problem (46) is feasible at time , then there is a feasible solution for all future time. Moreover, the closed-loop system is stochastically stable by the feasible event-triggered predictive state-feedback control law in algorithm 1.*

*Proof. **Recursive Feasibility*. According to the assumption, the augmented closed-loop system (17), since the state-feedback MPC optimization problem (46) is feasible at time , we assume that the optimal solution is . At time , we can obtain a solution ; it is obvious that the new solution satisfies LMIs (23)-(26) and (37), (38), (39), (40), and (44) since the parameters are independent of the initial state . Hence, to prove recursive feasibility, we only need to prove the LMI (21) can be satisfied at time . According to Theorem 5, we have Since the augmented state measured at , it means ; it also needs to satisfy . Then, at time , the feasible solution is . At time , the data status have two conditions which should be considered. Case 1: 1 1, that is, At time , we assume that the optimal solution is . At time , by a similar analysis, we can obtain the feasible solution . Case 2: 1 0, that is, Since data are lost at time , by solving optimization problem (46) and calculated by quantization and event-triggered scheme. We can get the control input at time , but this data cannot be transmitted to the actuator successfully. Thus, the control input is dependent on the optimization problem at time . According Theorem 5, we have . For this data status, since the augment closed-loop system we can obtain ; thus, it also can concluded that . Furthermore, is a feasible solution at time . At time , by a similar analysis, the feasibility of optimization problem can be guaranteed.*Closed-Loop Stability*. After above analysis, the recursive feasibility of (46) can be guaranteed; it means that the solution of (46) at time is also feasible at time , which means is feasible for the optimization problem (46) at time Since , thus is decreasing and will converge to a little value with the increase of time ; it means will converge to a neighborhood of . Then the closed-loop stability can be proved.

#### 4. Simulations

In this section, we proposed an example to demonstrate the merits of the presented method, and the figures in this simulation are reproduced from [37].

Consider that a 2-rule IT2 T-S fuzzy system and the matrices are given as follows:

Define the membership functions for the IT2 T-S fuzzy system as follows: