Research Article  Open Access
EventDriven Control for NCSs with Logarithmic Quantization and Packet Losses
Abstract
The stabilization problem of the networked control systems (NCSs) affected by data quantization, packet losses, and eventdriven communication is studied in this paper. By proposing two eventdriven schemes and the extended forms of them relying on quantized states, zoom strategy is adopted here to study the system stability with timevarying logarithmic quantization and independent identically distributed (IID) packet losses process. On the basis of that, some sufficient conditions ensuring the mean square stability of the system are obtained here. Although zoom strategy has been utilized by many literatures to study the quantized stabilization problem of NCSs, it has not been adopted to analyze the stability of NCSs with data quantization, IID packet losses, and eventdriven communication. Furthermore, the existing literatures relating to zoom strategy employ the quantizer with quantization regions holding arbitrary shapes, but here we use the logarithmic quantizer which holds better performance near the origin. In addition, the detailed comparisons of the system performance under different eventdriven schemes are given here, which can guide the strategy selection according to the different design goals. The above three points are the main innovations of this paper. At last, the effectiveness of the proposed methods is illustrated by a benchmark example.
1. Introduction
The introduction of the network in the control system brings us a lot of convenience, such as increased flexibility and maintainability and reduced wiring cost. However, network inserted in the control system also brings some new challenges for studying the stability and stabilization problems of the closedloop system. Under the networkinduced imperfections including data quantization, transmission delay, packet losses, and communication constraints, the sampled signals can not be transmitted timely and accurately through the network, which results in the fact that the system performance may be degraded, or even instability. How to design suitable controller based on noncomplete information to stabilize the NCSs has gotten a lot of attention in recent years.
As two important issues in NCSs, quantization and packet losses have been researched by many literatures including [1–11]. Ji et al. study the mean square quadratic stabilization problem for NCSs with arbitrary packet losses and Markovian jump packet losses, respectively, in [1] and [2]. An optimal quantizer/controller design method is represented in [3]. For the systems with multiple networks, literature in [4] proposes a less conservative sufficient stabilizing bit rate condition. The problem of optimal tracking of multiinput multioutput systems with quantization and packetdropouts is studied in [5]. Literature in [6] discusses the quantized control problem for the neural network affected by distributed time delay and packet losses. For the linear systems and fuzzy systems affected by delays, quantization, and packet dropout, observerbased output feedback controllers are designed in [7] and [8], respectively. Moreover, the design criteria for the static output feedback controller, optimal dynamic quantizer, and controller are researched in [9], [10], and [11], respectively.
Some special methods have been adopted to deal with quantization and packet losses issues, such as [12–19]. A sliding mode controller is designed in literature [12] to stabilize the NCSs. A switched dynamic controller is proposed in [13] by converting the system into a timedelay switched system. By adopting model predictive control method, literatures in [14] and [15] discuss the issues of quantization and packet losses for nonlinear systems and constrained feedback control systems, respectively. Literature in [16] also discusses the effect of timevarying delay on system performance by quantized predictive control method. By utilizing zoom strategy, we discuss the quantized control for linear systems and fuzzy systems with packet losses in [17] and [18], respectively, and consider the unknown disturbances simultaneously in [19].
Eventdriven scheme is a useful method to reduce the communication resources in contrast with the periodic protocol, which means that just important signals are sent through the network; that is, if the signals being sampled have not altered sufficiently, there is no superiority to transfer them. Some papers have discussed the quantized control for the systems with eventdriven scheme, such as [20–22]. By adopting an eventdriven zero order holder to deal with the effects of stochastic packet losses, the stochastic stability of the system under quantized control is discussed in [20]. Under the eventdriven communication, literature in [21] studies the synchronization for networked passive systems with data quantization. For the hybrid NCSs, [22] derives a sufficient condition of the stochastic stability by proposing a distributed eventtriggered scheme and multiple quantization method.
The purpose of this paper is studying the issues of quantization and packet losses for NCSs under eventdriven communication. In fact, the problem studied here has been researched in [23, 24]. By restraining the upper bound of the number of successive packet losses and adopting the logarithmic quantization strategy proposed in [25, 26], the sufficient conditions ensuring the asymptotical stability of the systems are shown in [23], in which an eventdriven scheme is designed by the errors between the current sampling states and the last transmitted states. The differences of this paper with [23] include three aspects. (i) In this paper, the packet losses are modeled as an IID process, under which the mean square stability rather than the asymptotical stability can be guaranteed. (ii) Although logarithmic quantizer is also used in our paper, the parameters of which are timevarying based on zoom strategy. However, the parameters in [23] are all fixed. (iii) The eventdriven scheme proposed here is according to the error between the current (quantized) sampling states and the last transmitted quantized states, which is more reasonable than [23]. Moreover, the stabilization problem discussed here is also studied in [24], where the quantized controller was given for NCSs with eventdriven communication by modeling the Markov packet losses process. The different points between this paper and [24] include the following: (i) the models of packet losses are different from each other. (ii) Zoom strategy is used in both our paper and [24]. However, quantizer used in [24] is proposed in [27], but the one we adopted is a logarithmic quantizer proposed in [25, 26]. (iii) Only one eventdriven scheme is adopted in [24]. But in this paper, we propose two eventdriven schemes and compare them with each other. Furthermore, we also extend the eventdriven schemes to the ones relating to an additional variable , the effect of which on the system performance is also studied.
Summarized above, our contributions with respect to earlier literatures are three aspects.
() Depending on the quantized states, two eventdriven schemes and the extended forms of them are proposed in this paper, which are more applicable due to the quantized data being indeed transmitted through the network under the limited bandwidth.
() The detailed comparison of the eventdriven schemes is given here, based on which users can choose different strategies according to their actual needs including minimizing transmission times, increasing convergence rate, or extending the applicable scope of the algorithm.
() Although there are many literatures using zoom strategy to deal with data quantization, the quantizer adopted there is the one proposed in [27]. Considering the advantages of the logarithmic quantizer, such as which holds better performance near the origin, we adopt zoom strategy to handle the stabilization problem for NCSs with logarithmic quantization, packet losses, and eventdriven communication. It is worth mentioning that the logarithmic quantization combined with zoom strategy has already been studied in our paper [28], but in which the packet losses and eventdriven scheme are all uncovered.
The organization of our paper is arranged as follows. The problem formulation including the detailed system, network, and closedloop system formulations is described in Section 2. Mean square stabilities of the closedloop system under two eventdriven schemes are studied in Sections 3 and 4. Some analysis and comparison results are illustrated in Section 5. Simulation and conclusion are given, respectively, in Sections 6 and 7.
Notation. dimensional Euclidean space is denoted as . and represent the positive real numbers set and positive integers set, respectively. The Euclidean norm in and corresponding induced matrix norm in are both illustrated by . For the positivedefinite matrix , and are, respectively, used to denote the maximum and minimum eigenvalues of it. The transposed matrix is indicated by . The least integer not less than is signified by the signal . Zero vector with dimension is denoted as .
2. Problem Formulation
2.1. System Formulation
We considers the following continuoustime system:where is the system state, denotes the control input, and and are constant matrices with appropriate dimensions. Given sampling period , system (1) can be rewritten as discretetime one: with and , where represents continuoustime instant and is the time step satisfying .
2.2. Network Formulation
2.2.1. Packet Losses
The packet losses process is modeled as an IID process, in which denotes the successful transmission of data packets at time instant , and represents the occurrence of packet losses. Moreover, we assume that the random variable satisfies and .
2.2.2. Data Quantization
For the th component of the state , , the timevarying logarithmic quantizer adopted in this paper is represented aswith , , , for any , . It is obvious that , , , and are the critical parameters of the logarithmic quantizer, which are all assumed to be undetermined. On the basis of , , the quantization value of the vector is defined as
Remark 1. Existing articles involving zoom strategy mostly use the quantizer defined in literature in [27]. Using logarithmic quantizer to deal with quantization and packet losses based on zoom strategy is one of the innovations of this paper.
2.2.3. EventDriven Scheme
To reduce the network burden, we set the sampling data to be transmitted just at some specific times. Denote the transmission times as with satisfying . Two eventdriven schemes are designed in this paper, in which is selected, respectively, asin which is a piecewise constant function denoted by where and are defined below.
2.3. ClosedLoop System
Under the above network constraints and eventdriven schemes, the controller is defined as
The following closedloop system can be obtained by combining (2) and (7):
The purpose of this paper is proposing suitable design methods for logarithmic quantizer such that the system (8) with the abovementioned networkinduced effects and eventdriven schemes (5a) and (5b) to achieve the mean square stability.
3. Stability Analysis for the System (8) under EventDriven Scheme (5a)
The aim of this section is to design suitable quantizer parameters including , , , and , under which the mean square stability of the system (8) under eventdriven scheme (5a) is guaranteed. To obtain this purpose, we rewrite (8) as with and .
Theorem 2. Assume that the packet loss rate is given, if there are positivedefinite matrix and matrix satisfyingthen the feedback matrix defined by with can ensure that the system (8) is mean square stability under eventdriven scheme (5a) if quantizer parameters , , and , are selected satisfying andfor any given , where and are, respectively, given as and with . Moreover, the variables and are determined by (15).
Proof. Let . Taking the fact into consideration, we get by the inequalities and for any matrices , , and positivedefinite matrix . Combine with (12) and the facts and , which directly derives that If the linear matrix inequality (10) holds, then it must give a positivedefinite matrix satisfying . Let ; then the inequality (13) gives us ZoomingOut Stage. In this stage, it set the system as uncontrolled form. The aim is designing a suitable quantizer parameter such that it gives a time instant , at which the system state is unsaturated, that is, . To achieve this purpose, we let , , where is an arbitrary given positive real number and the selection of satisfies . Hence there must exist a time instant satisfying indicating that and thus hold, which accomplishes the goals of this stage.
ZoomingIn Stage. At time instant , zoom strategy is transferred to zoomingin stage, and the mode of the system is changed from openloop to closedloop. The aim of this stage is to design appropriate quantizer parameters and time instants such that . In order to obtain this aim, we first prove that is an invariant set. In fact, if , then , and thus and hold for any by using . Hence we get Moreover, eventdriven scheme (5a) tells us Combined with (14), (17), and (18), we see Thus the set defined by with is obviously an invariant set. If we define and select satisfying , where , then it must be , and hence is an invariant set.
By defining and , we will next prove with if is selected as . In order to achieve this purpose, we will first prove If we assume that (24) is unsatisfied, this means Defining the set as then it must be . This gives the fact that is an invariant set, which combined with (25) tells us and thus for any . Similar to the analysis of (14)–(19), we know that for any . Hence we get But (16) and (25) give us which contradicts formula (29). So the inequality (24) must be established, which means indicating that (23) holds. Moreover, we define as Similar to the analysis of , it is easy to see that is an invariant set and , . Similarly, for any , by definingwe get that , holds, and thus , Taking the limit on both sides of above inequality, it gives . This completes the proof.
4. Stability Analysis for System (8) under EventDriven Scheme (5b)
In order to design quantizer parameters , , , and such that the system (8) under eventdriven scheme (5b) is mean square stability, we first rewrite the system (8) as with , by which the following theorem can be derived.
Theorem 3. We assume that the packet loss rate is fixed, if it gives positivedefinite matrix and matrix such thatthen the mean square stability of the system (8) with eventdriven scheme (5b) under the feedback matrix defined by with can be ensured if quantizer parameters , , and , , satisfy andfor any given , where and are, respectively, given as and with . Moreover, the variables and are also described by (15).
Proof. Set ; direct calculations give If (35) is satisfied, there must exist a positivedefinite matrix such that Let ; from (37) and (38) we can easily get As can be seen from the above formula, there is no need to discuss the impact of quantization errors on system stability in the following analysis. However, since the quantizer has a saturation boundary, the distance between and may always be greater than . In order to ensure that events under the eventdriven scheme (5b) are not triggered frequently, it is necessary to discuss and restrain the range of values for in the analysis process. Based on this, the selection method of in the zoomingout stage of Theorem 2 is adopted here to ensure the boundedness of ; that is, Combining with (39) and (40) gives us With the analytical ideas of Theorem 2, we obtain that if variables , , , and , are defined as and , , then we get and thus . The proof is completed.
5. Analysis and Comparison
The aim of this section is analyzing and comparing the above two theorems, which includes the following four items.
() It can be seen from the proof process of above two theorems that the two eventdriven schemes (5a) and (5b) proposed here can effectively simplify the system stability analysis, which means that (5a) and (5b) are with specific high practicability. In addition, from the theorem derivation process, we see that the analysis process under the eventdriven scheme (5b) is simpler than the one under (5a).
() Both the parameters given in Theorems 2 and 3 can ensure the system stability. But, by comparing conditions (10) and (35), we know that the result of Theorem 2 must be more conservative than the one of Theorem 3 from the point of view of the maximum allowable packet loss rate.
() Contrasting (11a), (11b), (36a), and (36b) gives the fact that, in general, defined in Theorem 3 is less (greater) than the one in Theorem 2. This means that the decreasing frequency of the mean squared value of the system state in Theorem 3 is slower than that of Theorem 2, but the decreasing rate in Theorem 3 is higher than the one in Theorem 2. Therefore, since the convergence time is affected by the combined effect of the decreasing frequency and the decreasing rate, we can not directly compare the magnitude of the convergence time between Theorems 2 and 3. The convergence time will be compared by simulation in Section 6.
(4) Obviously, for any given , if defined in eventdriven schemes (5a) and (5b) is changed as then the stability analysis process can still be simplified. Taking Theorem 3 as an example, if is defined by (44), then the variables and defined by (36a) and (36b) should be changed as which means that if , comparing with the case of , we have
(i) the range of values of becoming smaller;
(ii) the decreasing frequency of the mean squared value of the state becoming faster; that is, decreases;
(iii) The decreasing rate of the mean squared value of the state decreasing; that is, increases.
Summarized above, comparing with Theorem 3, if is defined by (44) with , then item (i) above tells us that the range of values of quantizer parameters is more conservative. Moreover, items (ii) and (iii) show that the increasing of is a doubleedged sword, and thus the value of and the actual convergence time can not be established a direct proportional relationship. To illustrate the effect of the variable on the system stability, we will compare the state mean square curve and analyze the convergence speed under different values of in the simulation.
6. Simulation
A wellknown benchmark example shown below is adopted here to represent the usefulness of the main results: with By selecting the discretization interval as , the continuoustime model above can be converted to the discretetime one given as with If the initial state is selected as , and other variables are selected as , , and given in Table 1, we can obtain the variables including , , , and the applicable scope of and under Theorems 2 and 3, respectively. The total transmission times between the 9000 iterations can also be obtained. Moreover, the mean square values of the states can be shown in Figure 1, from which the mean square stability is guaranteed, and the convergence time can also be estimated.
Comparison of Theorems 2 and 3. From Table 1, we see that
(i) the applicable scope of Theorem 3 is larger than the one of Theorem 2 due to the fact that it can tolerate the smaller coding length and the larger packet loss rate ;
(ii) the convergence time under Theorem 3 is less than the one under Theorem 2, which means that Theorem 3 is better than Theorem 2 from the system performance point of view. However, Theorem 3 needs more transmission times than Theorem 2 to ensure the stability, which represents the fact that Theorem 2 is superior to Theorem 3 in terms of saving the network bandwidth.
Comparison of System Performance under Different Values of . To illustrate the effect of different values of defined in (44) on system performance, we select and show the relating variables and state trajectories in Table 2 and Figure 2, respectively.

From Table 2, we know the following:
(i) With the increase of , the applicable scope of the theorem is reduced; that is, the allowable lower bound of is increased.
(ii) When increases, the decreasing interval decreases but the decreasing rate increases, under the coupling actions of which the convergence time is prolonged. However, the transmission times are reduced as long as increases. Therefore, in the premise of ensuring the convergence of the system, if it takes the minimum transmission times as the goal, then the value of should be increased. Otherwise, if the goal is increasing convergence rate or the applicable scope of the algorithm, then should be reduced appropriately.
7. Conclusion
The mean square stability of NCSs with data quantization, packet losses, and eventdriven communication is studied in this paper. Some sufficient conditions are given to ensure the mean square stability of the closedloop system. From Figures 1 and 2, it is seen that the convergence speed of the state trajectory is low due to the large value of ; how to improve it is one of our future research directions.
Conflicts of Interest
The author declares that they have no conflicts of interest.
Acknowledgments
The work was supported by the National Natural Science Foundation of China (61403125, 61773154, 41501562, 61304258, 61503123, and U1504616), the Natural Science Foundation of Henan Province Education Department (15A413012), and the Fundamental Research Funds for the Henan Provincial Colleges and Universities in Henan University of Technology (2015RCJH15).
References
 M. Ji, Y. Cai, and W. Zhang, “Stabilization of discretetime linear systems with quantization and arbitrary packet losses,” Transactions of the Institute of Measurement and Control, vol. 37, no. 9, pp. 1084–1094, 2015. View at: Publisher Site  Google Scholar
 M. Ji, Z. Li, and W. Zhang, “Quantized feedback stabilization of discretetime linear system with markovian jump packet losses,” Neurocomputing, vol. 158, pp. 307–314, 2015. View at: Publisher Site  Google Scholar
 F.L. Qu, B. Hu, Z.H. Guan, Y.H. Wu, D.X. He, and D.F. Zheng, “Quantized stabilization of wireless networked control systems with packet losses,” ISA Transactions, vol. 64, pp. 92–97, 2016. View at: Publisher Site  Google Scholar
 Q. Ling, “A sufficient bit rate condition for meansquare stabilisation of linear systems over multiple lossy networks,” IET Control Theory & Applications, vol. 10, no. 13, pp. 1531–1538, 2016. View at: Publisher Site  Google Scholar  MathSciNet
 X.W. Jiang, X.H. Zhang, Z.H. Guan, L. Yu, and H.C. Yan, “Performance limitations of networked control systems with quantization and packet dropouts,” ISA Transactions, vol. 67, pp. 98–106, 2017. View at: Publisher Site  Google Scholar
 Q.L. Han, Y. Liu, and F. Yang, “Optimal communication networkbased ${H}_{\infty}$ quantized control with packet dropouts for a class of discretetime neural networks with distributed time delay,” IEEE Transactions on Neural Networks and Learning Systems, vol. 27, no. 2, pp. 426–434, 2016. View at: Publisher Site  Google Scholar
 M. S. Mahmoud and M. H. Baig, “Networked feedback control for systems with quantization and nonstationary random delays,” IMA Journal of Mathematical Control and Information, vol. 32, no. 1, pp. 119–140, 2015. View at: Publisher Site  Google Scholar  MathSciNet
 M. S. Mahmoud and N. B. Almutairi, “Feedback fuzzy control for quantized networked systems with random delays,” Applied Mathematics and Computation, vol. 290, pp. 80–97, 2016. View at: Publisher Site  Google Scholar  MathSciNet
 S. Jiang and H. Fang, “Quantized stabilization of discretetime systems in a networked environment,” Applied Mathematical Modelling, vol. 38, no. 56, pp. 1685–1697, 2014. View at: Publisher Site  Google Scholar  MathSciNet
 W.C. Hsu, L.W. Lee, K.H. Tseng, C.Y. Lu, C.W. Liao, and H.N. Shou, “Design of feedback control for networked finitedistributed delays systems with quantization and packet dropout compensation,” Discrete Dynamics in Nature and Society, Article ID 158972, Art. ID 158972, 15 pages, 2015. View at: Publisher Site  Google Scholar  MathSciNet
 M. Li, J. Sun, and L. Dou, “Stability of an improved dynamic quantised system with timevarying delay and packet losses,” IET Control Theory and Applications, vol. 9, no. 6, pp. 988–995, 2015. View at: Publisher Site  Google Scholar  MathSciNet
 R. Lu, P. Yang, J. Bai, and A. Xue, “Quantized observerbased sliding mode control for networked control systems via the timedelay approach,” Circuits, Systems, and Signal Processing, vol. 35, no. 5, pp. 1563–1577, 2016. View at: Publisher Site  Google Scholar
 S. Wang, M. Yu, H. Wang, and W. Tan, “Switched quantization level control of networked control systems with packet dropouts,” Mathematical Problems in Engineering, vol. 2014, Article ID 890543, pp. 1–8, 2014. View at: Publisher Site  Google Scholar  MathSciNet
 J. Yu, L. Nan, X. Tang, and P. Wang, “Model predictive control of nonlinear systems over networks with data quantization and packet loss,” ISA Transactions, vol. 59, pp. 1–9, 2015. View at: Publisher Site  Google Scholar
 Y. Zou, J. Lam, Y. Niu, and D. Li, “Constrained predictive control synthesis for quantized systems with Markovian data loss,” Automatica, vol. 55, pp. 217–225, 2015. View at: Publisher Site  Google Scholar  MathSciNet
 M. Li, L. Dou, J. Sun, and D. Wang, “Dynamic quantized predictive control for systems with timevarying delay and packet loss in the forward channel,” Mathematical Problems in Engineering, vol. 2015, Article ID 596916, pp. 1–11, 2015. View at: Publisher Site  Google Scholar  MathSciNet
 J. Yan, Y. Xia, B. Liu, and M. Fu, “Stabilisation of quantised linear systems with packet dropout,” IET Control Theory & Applications, vol. 5, no. 8, pp. 982–989, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 J. Yan, Y. Xia, and L. Li, “Stabilization of fuzzy systems with quantization and packet dropout,” International Journal of Robust and Nonlinear Control, vol. 24, no. 10, pp. 1563–1583, 2014. View at: Publisher Site  Google Scholar  MathSciNet
 J. Yan and Y. Xia, “Quantized control for networked control systems with packet dropout and unknown disturbances,” Information Sciences, vol. 354, pp. 86–100, 2016. View at: Publisher Site  Google Scholar
 E. Konaka, “Stability of networked control system with dynamic quantizer and eventdriven zeroorder hold,” in Proceedings of the SICE (Society of Instrument and Control Engineers) Annual Conference (SICE '07), pp. 1892–1897, Takamatsu, Japan, September 2007. View at: Publisher Site  Google Scholar
 H. Yu and P. J. Antsaklis, “Quantized output synchronization of networked passive systems with eventdriven communication,” in Proceedings of the 2012 American Control Conference (ACC), pp. 5706–5711. View at: Google Scholar
 D. Du, B. Qi, M. Fei, and Z. Wang, “Quantized control of distributed eventtriggered networked control systems with hybrid wiredwireless networks communication constraints,” Information Sciences, vol. 380, pp. 74–91, 2017. View at: Publisher Site  Google Scholar
 F.L. Qu, Z.H. Guan, D.X. He, and M. Chi, “Eventtriggered control for networked control systems with quantization and packet losses,” Journal of the Franklin Institute, vol. 352, no. 3, pp. 974–986, 2015. View at: Publisher Site  Google Scholar  MathSciNet
 H. Yang, Y. Xu, and J. Zhang, “Eventdriven control for networked control systems with quantization and Markov packet losses,” IEEE Transactions on Cybernetics, vol. 47, no. 8, pp. 2235–2243, 2017. View at: Publisher Site  Google Scholar
 N. Elia and S. K. Mitter, “Stabilization of linear systems with limited information,” IEEE Transactions on Automatic Control, vol. 46, no. 9, pp. 1384–1400, 2001. View at: Publisher Site  Google Scholar  MathSciNet
 M. Fu and L. Xie, “The sector bound approach to quantized feedback control,” IEEE Transactions on Automatic Control, vol. 50, no. 11, pp. 1698–1711, 2005. View at: Publisher Site  Google Scholar  MathSciNet
 D. Liberzon, “Hybrid feedback stabilization of systems with quantized signals,” Automatica, vol. 39, no. 9, pp. 1543–1554, 2003. View at: Publisher Site  Google Scholar  MathSciNet
 J. Yan, “Parameters design for logarithmic quantizer based on zoom strategy,” Journal of Control Science and Engineering, vol. 2017, Article ID 4028258, pp. 1–9, 2017. View at: Publisher Site  Google Scholar  MathSciNet
Copyright
Copyright © 2017 Jingjing Yan. 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.