Research Article | Open Access

Qixin Zhu, Kaihong Lu, Yonghong Zhu, " Guaranteed Cost Control for Networked Control Systems under Scheduling Policy Based on Predicted Error", *Mathematical Problems in Engineering*, vol. 2014, Article ID 586029, 12 pages, 2014. https://doi.org/10.1155/2014/586029

# Guaranteed Cost Control for Networked Control Systems under Scheduling Policy Based on Predicted Error

**Academic Editor:**Ge Guo

#### Abstract

Scheduling policy based on model prediction error is presented to reduce energy consumption and network conflicts at the actuator node, where the characters of networked control systems are considered, such as limited network bandwidth, limited node energy, and high collision probability. The object model is introduced to predict the state of system at the sensor node. And scheduling threshold is set at the controller node. Control signal is transmitted only if the absolute value of prediction error is larger than the threshold value. Furthermore, the model of networked control systems under scheduling policy based on predicted error is established by taking uncertain parameters and long time delay into consideration. The design method of guaranteed cost controller is presented by using the theory of Lyapunov and linear matrix inequality (LMI). Finally, simulations are included to demonstrate the theoretical results.

#### 1. Introduction

Networked control systems (NCS) are frequently encountered in practice for widespread fields of applications due to their suitable and flexible structure [1, 2]. Nevertheless, networked control systems have various equipments, complicated structure, and large scale, and they require a high level for safety and reliability. Meanwhile, the characteristics of NCS, such as authorization of the spectrum, dynamic mobile, limited channels, and broadcast transmission, make themselves inevitably existing transmission delay and data packet loss, which could cause adverse effect to system and even lead to instability. Therefore, concerning how to reduce the negative influence on the system control performance, energy consumption of nodes has become one of the hot issues in the control field.

Literatures in the aspects of NCS have got plenty of achievements on stability analysis and controller design considering uncertain parameters, time delay, noise, and other factors [3–7]. All of the above have not involved the scheduling problems of networked control systems. For example, the problem of integrated design of controller and communication sequences is addressed for NCS with simultaneous consideration of medium access limitations and network-induced delays, packet dropouts, and measurement quantization in [6]. However, only relying on the controller design is difficult to improve the control performance of system effectively if a large number of data share the limited bandwidth. Reasonable network scheduling strategies to reduce the conflict and the energy consumption of controller nodes are introduced in [8–12]. In order to satisfy timeliness of messages and improve system's flexibility in NCS based on controller area network (CAN), a distributed dynamic message scheduling method based on deadline of message (DM) is proposed in [8]. A receding-horizon control and scheduling (RHCS) problem with a quadratic performance criterion is formulated and solved by (relaxed) dynamic programming in [9], but it is not considering the guaranteed cost problem. Zhao et al. [10] proposed a predictive control and scheduling codesign approach to deal with the controller and scheduler design for a set of networked control systems which are connected to a shared communication network. In [11], the scheduling of sensor information towards the controller is ruled by the classical Round-Robin protocol and the induced -gain of NCS is analyzed, which is subject to time-varying transmission intervals, time-varying transmission delays, and communication constraints, but not referring to the affect of interference input and the guaranteed cost problem.

With the rapid development of computer technology, sensors sampling frequency and the processing speed of the controller are being improved continually; network conflict is becoming more and more serious at actuators side because of the limited channels of network during the transmission of information. So, it is important to explore a reasonable scheduling policy to reduce the network conflict at actuator node and to avoid the loss of important information. This motivates us to conduct the research work.

In this paper, scheduling policy based on model prediction error is presented to reduce energy consumption and network conflicts at the actuator node, in which the characters of NCS are considered, such as limited network bandwidth, limited node energy, and high collision probability. The prediction model is introduced to predict the state of system at the sensor node, and then referential value of control signal is obtained after the predicted value of state is calculated by the controller. And scheduling threshold is set at the controller node. Control signal is not transmitted if the absolute value of prediction error is lower than the threshold value. Moreover, the design method of guaranteed cost controller is presented by using the theory of Lyapunov and linear matrix inequality (LMI) theory. Finally, simulations are included to demonstrate the theoretical results.

The paper is organized in 5 sections including the introduction. Section 2 presents models for NCS under scheduling policy based on predicted error and main assumptions. Section 3 presents the controller design of NCS under scheduling policy based on predicted error. There are some simulations to illustrate the results in Section 4. Section 5 summarized this paper.

#### 2. Modeling for Networked Control Systems

The structure of networked control systems under scheduling policy based on predicted error is shown in Figure 1, where , , and represent state value sampled by sensors, state value predicted by model, and prediction error at time separately, while represents the th sampling period.

Consider the NCS model with uncertain parameters as follows: where , , , and represent state value, input, output, and interference input separately; , , , , , , and are matrices with appropriate dimensions; , , and are matrices with uncertain time-varying parameters, satisfying ; is an unknown matrix function with Legesgue measurable properties, satisfying ; , , , and are constant matrices with appropriate dimensions.

To facilitate discussion, some assumptions are employed as follows.(A1)The state of NCS is completely measurable.(A2)The cache devices are not used both at actuators end and at sensors end.(A3)Sensors, controllers, and actuators are all time driving. Before the first controlled input reaches the actuator, controlled input always maintains .(A4)Forward channel delay caused by the network is denoted by , while backward channel delay is denoted by , and is an integer in any case.

*Remark 1. *Based on assumption 2, system information obtained by controller is only the state of system object, namely, .

##### 2.1. Analysis on Time Delay for Networked Control Systems under Scheduling Policy Based on Predicted Error

Based on assumption 4, the feedback information received by system controller at time is the state of system object at time without considering the data packet loss. Controlled input is obtained after controller calculates the information transmitted by sensor and then is transmitted to the actuator through network. The controlled input reaches actuator and work at time . Hence, for the sensor node, the entire network delay becomes . System (1) can be written as Based on assumption 1 and Figure 1, state feedback is introduced as follows:

##### 2.2. The Description of Model Prediction Error

The controller nodes use the th received data packets which are sampled and transmitted by sensor to predict the state of the model at next time, and then the predicted value of state is transmitted to controller. The predictive control signal is obtained after the predicted value of the state is calculated. After getting the prediction error by comparing predicted value of control signal with the true value at time , the state value is updated spontaneously. In addition, to trace the state trajectory of system, we use certain parameters of the object model (1) to predict and calculate the referential value of control signal. The prediction model can be described as follows: where , , and refer to (1) and (3) and is the referential value of control signal.

The predicted error of control signal produced by the model is shown as follows:

##### 2.3. The Description of Scheduling Policy

With the rapid development of computer technology, sensors sampling frequency and the processing speed of the controller are being improved continually; network conflict is becoming more and more serious at actuators side because of the limited channels of network during the transmission of information. So it is important to introduce reasonable scheduling policy to reduce the network conflict at actuator node. Here we introduce the restrained condition of transmission as ( represents scheduling threshold, , and is the dimension of the control signal). Controller will not send the control signal taken as unimportant information to actuator and the actuator keeps the value of control signal at time if the restrained condition is satisfied, which helps to reduce the transmission frequency of unimportant information at actuator node.

According to the description above, piecewise function as follows is introduced:

Moreover, we introduce where represents that should not be transmitted, while represents that should be transmitted. We define . Obviously, equality (6) is equivalent to

*Remark 2. *According to the description about above, the total number of cases that could appear should be in the whole scheduling process; that is to say,

*Remark 3. *Obviously, different from the previous method, such as [8], in which referential value of scheduling policy based on deadline of message is a fixed value. The referential value in Section 2.2 of scheduling policy based on predicted error obtained by using certain parameters of the object model (1) to predict the value of system is varied with the change of the system state trajectory. In this way, a bigger chance for losses of unimportant information in NCS is offered than the previous method as [8]; that is to say, scheduling policy based on predicted error is more effective to avoid the network conflict and save energy of nodes.

##### 2.4. Augmented System Model of NCS under Scheduling Policy Based on Predicted Error

Based on the description of equalities (3) and (8) and Remark 2, it can be obtained that The augmented matrix is defined as Therefore, the augmented NCS model becomes where Obviously, (12) is a switching model; the number of switching modes is .

#### 3. Guaranteed Cost Control for NCS

For the system model established above, performance indicator is given as follows: where , , , , and are symmetric positive definite matrices.

*Definition 4. *For system (2) and system (12), it satisfies that (1) the closed-loop system is asymptotically stable if ; (2) under any zero initial condition, given , for any nonzero vector , the output satisfies . It is called that system (2) and (12) is asymptotically stable with norm bound .

Lemma 5 (Schur complement). *For a symmetric matrix , where , , and , the following three conditions are equivalent:*(1)*;*(2)*, ;*(3)*, .*

Lemma 6 (see [3]). *, , , and are matrices with suitable dimensions, satisfying , and is symmetric matrix; then is equivalent to
**
where scalar .*

Lemma 7 (see [13]). *For matrices , , and with appropriate dimensions, where , satisfying . If there exists , where is a set of scalars , it satisfies that
*

##### 3.1. Stability Analysis of NCS under Scheduling Policy Based on Predicted Error

Theorem 8. *Given symmetric positive definite matrices and , if there exist symmetric positive definite matrix , the gain matrix , and constant , satisfying
**
then it is called that system (2) and (12) is asymptotically stable with norm bound . And its performance indicator satisfies , where * represents the symmetry blocks of matrix; , , and are shown as (12); and , , and are shown as (14).*

*Proof. *Because system (12) is the equivalent system of system (2), system (2) must satisfy the condition if and only if system (12) satisfies the asymptotically stable condition. Consider the following Lyapunov function:
Conducting subtract operating along arbitrary trajectory of system (12) is given by
Submitting (12) into (19) yields
Plus at two ends of equality (20), we have
where
If
it can be obtained that . Based on equality (21), it is known that
If , obviously, there is .

From zero initial condition, we know . And it can be obtained that . Therefore,
Moreover,
Therefore, we have
Namely, . Based on Definition 4, it is known that system (2) and (12) is asymptotically stable with norm bound . Inequality (23) can be written as
Namely,
It can be obtained that
Namely, .

Because the process above elucidated that the system is asymptotically stable, we have . Therefore, is verified.

Inequality (23) can be written as
Using Lemma 5, we have
Using Lemma 5, inequality (32) is equivalent to inequality (17); thus, Theorem 8 is verified.

*Remark 9. *Uncertain system forms like are contained in matrix inequality (17), so the problem cannot be solved by using LMI toolbox. The next work is conducting appropriate deformation to eliminate the uncertainties in the matrix and convert it to linear matrix inequality (LMI), in which variable parameters are contained.

##### 3.2. The Controller Design of NCS under Scheduling Policy Based on Predicted Error

Theorem 10. *Given symmetric positive definite matrices and , if there exist a set of symmetric positive definite matrices , matrix , and a set of constants , , , , and , satisfying**where** and are shown as (12) and and are shown as (14).**It is called that system (2) and (12) is asymptotically stable with norm bound ; the gain matrix of feedback control is . And its performance indicator satisfies . * represents the symmetry blocks of matrix.*

*Proof. *The proof is based on a suitable congruence transformation and a change of variables allowing us to obtain inequality (17). and can be written as , , where
Inequality (17) can be written as
Based on Lemma 6, we have
Based on Lemma 5, inequality (37) is equivalent to
And it can be written as
Using Lemma 6 again, it can be obtained that
Using Lemma 5 again, inequality (40) is equivalent to
By denoting , naturally, we have . By premultiplying and postmultiplying inequality (41) by , with the change of variables , , , , it can be obtained that
where
Inequality (42) can be written as
whereFrom Lemma 7, it can be obtained that
Namely, if
there is
Inequality (47) can be written asBased on Lemma 5, inequality (49) is equivalent to inequality (33).

From , we have ; thus, Theorem 8 is verified.

exists not only in Definition 4 but also in Theorem 10; this paper gets the value of by solving the following optimization problem:

#### 4. Simulations

Consider the parameters of system (2) as follows: Here select the sampling period , .

It can be obtained that Consider

By taking advantage of inequality (33) in Section 3, it can be obtained that

The following two group thresholds of restrained transmission will be selected for simulation experiments.(1)Select , and , in other words, when the prediction error produced by model (4) meets the following:(a)if , the controller does not send to the actuator;(b)if , the controller does not send to the actuator.(2)Select , and , in other words, when the prediction error produced by model (4) meets the following:(a)if , the controller does not send to the actuator;(b)if , the controller does not send to the actuator.The initial states of system are as follows: , , ; it can be obtained that(1)the performance index of the system in the threshold condition (1) is ;(2)the performance index of the system in the threshold condition (2) is .

The system under scheduling policy based on predicted error is stable according to the state response curve shown in Figure 2. However, due to the characteristics of the scheduling model based on the prediction error and the system's uncertainties, the state is not keeping zero all the time but in dynamic equilibrium. The simulation results show that the changeable range of system in a state of equilibrium in the threshold condition (1) is lower than that in the threshold value condition (2). Therefore, the stability of system in the threshold condition (1) is better. It manifests that the stability of system under scheduling policy based on predicted error relates to restrained transmission threshold.

**(a) State response of NCS in the threshold condition (1)**

**(b) State response of NCS in the threshold condition (2)**

After entering the steady state, data will stop being transmitted and calculated unless interference makes the value of prediction error surpass the value of threshold. In order to facilitate comparison, the number of data packet losses at time is obtained by calculating the total number of packet losses from time to time as Figure 3. Obviously, at the beginning stage, very few packets are dropped. With the system getting closer to steady state, data transmission and calculating are terminated gradually. By the calculation, the average packet loss rate of NCS is 35.45% in the threshold value condition (1) during the whole simulation, while it can achieve 54.08% in the threshold value condition (2). Actually, because of larger value of threshold, the packet loss probability of system in the threshold value condition (2) is larger than that in the threshold value condition (1), which manifests that setting a bigger threshold value is more helpful to save energy at the actuator nodes.

**(a) Packet losses of NCS in the threshold condition (1)**

**(b) Packet losses of NCS in the threshold condition (2)**

In addition, we apply the method proposed by Longo et al. [12] into the same problem. The average packet loss rate of NCS is 4.72% in the threshold value condition (1) and is in the threshold value condition (2). And the design of control fails with shown in Figure 4. Thus, it sufficiently demonstrates the effectiveness and feasibility of this paper.

**(a) State response of NCS in the threshold condition (1)**

**(b) State response of NCS in the threshold condition (2)**

#### 5. Conclusions

In this paper, scheduling policy based on model prediction error is presented to reduce energy consumption and network conflicts at the actuator node, where the characters of NCS are considered, such as limited network bandwidth, limited node energy, and high collision probability. The object model is introduced to predict the state of system at the sensor node. And scheduling threshold is set at the controller node. Control signal is transmitted only if the absolute value of prediction error is larger than the threshold value. And the model of NCS under scheduling policy based on predicted error is established by taking uncertain parameters and long time delay into consideration. The design method of guaranteed cost controller is presented by using the theory of Lyapunov and linear matrix inequality (LMI). The stability of NCS under scheduling policy based on predicted error relates to restrained transmission threshold. And setting different restrained transmission threshold, the number of dropped packets is obviously different. After all, the feasibility and effectiveness of method in this paper are demonstrated. The next research task will be choosing reasonable parameters () to reduce the conservative.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This work was partly supported by the National Nature Science Foundation of China (61164014 and 51375323), the China Postdoctoral Science Foundation (20100480131), the Science and Technology Support Project Plan of Jiangxi Province, China (2010BGB00607), and the Natural Science Foundation of Jiangxi Province, China (2010GZC0118).

#### References

- J. K. Yook, D. M. Tilbury, and N. R. Soparkar, “Trading computation for bandwidth: reducing communication in distributed control systems using state estimators,”
*IEEE Transactions on Control Systems Technology*, vol. 10, no. 4, pp. 503–518, 2002. View at: Publisher Site | Google Scholar - D. Liberzon, “On stabilization of linear systems with limited information,”
*IEEE Transactions on Automatic Control*, vol. 48, no. 2, pp. 304–307, 2003. View at: Publisher Site | Google Scholar | MathSciNet - M. B. G. Cloosterman, N. van de Wouw, W. P. M. H. Heemels, and H. Nijmeijer, “Stability of networked control systems with uncertain time-varying delays,”
*IEEE Transactions on Automatic Control*, vol. 54, no. 7, pp. 1575–1580, 2009. View at: Publisher Site | Google Scholar | MathSciNet - G.-P. Liu, Y. Xia, D. Rees, and W. S. Hu, “Design and stability criteria of networked predictive control systems with random network delay in the feedback channel,”
*IEEE Transactions on Systems, Man and Cybernetics C*, vol. 37, no. 2, pp. 173–184, 2007. View at: Publisher Site | Google Scholar - M. B. G. Cloosterman, L. Hetel, N. van de Wouw, W. P. M. H. Heemels, J. Daafouz, and H. Nijmeijer, “Controller synthesis for networked control systems,”
*Automatica*, vol. 46, no. 10, pp. 1584–1594, 2010. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - G. Guo and H. Jin, “A switching system approach to actuator assignment with limited channels,”
*International Journal of Robust and Nonlinear Control*, vol. 20, no. 12, pp. 1407–1426, 2010. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - G. Guo, “A switching system approach to sensor and actuator assignment for stabilisation via limited multi-packet transmitting channels,”
*International Journal of Control*, vol. 84, no. 1, pp. 78–93, 2011. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - W. Qinmu, L. Yesong, and Q. Yi, “A scheduling method based on deadline for CAN-based networked control systems,” in
*Proceedings of the IEEE International Conference on Mechatronics and Automation (ICMA '06)*, pp. 345–350, June 2006. View at: Publisher Site | Google Scholar - D. Görges, M. Izák, and S. Liu, “Optimal control and scheduling of networked control systems,” in
*Proceedings of the 48th IEEE Conference on Decision and Control*, pp. 5839–5844, December 2009. View at: Publisher Site | Google Scholar - Y. B. Zhao, G. P. Liu, and D. Rees, “Integrated predictive control and scheduling co-design for networked control systems,”
*IET Control Theory & Applications*, vol. 2, no. 1, pp. 7–15, 2008. View at: Publisher Site | Google Scholar | MathSciNet - K. Liu, E. Fridman, and L. Hetel, “Stability and ${L}_{2}$-gain analysis of networked control systems under Round-Robin scheduling: a time-delay approach,”
*Systems & Control Letters*, vol. 61, no. 5, pp. 666–675, 2012. View at: Publisher Site | Google Scholar | MathSciNet - S. Longo, G. Herrmann, and P. Barber, “Robust scheduling of sampled-data networked control systems,”
*IEEE Transactions on Control Systems Technology*, vol. 20, no. 6, pp. 1613–1621, 2012. View at: Publisher Site | Google Scholar - Y. S. Lee, Y. S. Moon, W. H. Kwon, and P. G. Park, “Delay-dependent robust ${H}_{\infty}$ control for uncertain systems with a state-delay,”
*Automatica*, vol. 40, no. 1, pp. 65–72, 2004. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet

#### Copyright

Copyright © 2014 Qixin Zhu et al. 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.