Abstract

The stabilization problem of a wireless networked control system is considered in this paper. Both time delay and packet loss exist simultaneously in the wireless network. The system is modeled as an asynchronous dynamic system (ADS) with unstable subsystems. A sufficient condition for the system to be stable is presented. A numerical example is given to demonstrate the effectiveness of the proposed approach.

1. Introduction

Networked control system (NCS) has received increasing attention in recent years due to its advantages, such as low cost, easy maintenance, and flexibility [1], and it has been applied in many areas, such as automobiles, building supervision, and manufacturing plants [2]. As an alternative for the wired network, the wireless network also has a wide range of applications due to its mobility; see [35] and the references therein.

As the network is introduced into the control system, many new problems arise due to the limited transmission capacity of the network, such as network-induced delay and packet loss. Many studies have been done in these areas, and some results are available in the literature, for example, the delay issue was studied in [612] and packet loss was studied in [1318]. However, in all the results above, the time delay and packet loss are considered separately, while in practice they exist simultaneously in the network. Recently, some papers also deals with this problem [1922]. In [19], a continuous system is considered and the effect of packet loss is considered to be equal to the time delay. A new model is proposed in [20] while the delay is assumed to be less than one sampling period. However, as to the discrete-time system, if the plant to be controlled is unstable intuitively, no method has been addressed, which will be considered here. In this paper, a switched system with time-varying delay model is firstly proposed to describe the wireless NCS, and a sufficient condition is given to stabilize the closed-loop system, and the controller is designed to be dependent on both the packet loss and time delay. A numerical example shows the effectiveness of the proposed approach.

The organization of this paper is as follows. The structure of the wireless network control system is given in Section 2 and a switched system with time-varying delay model is established. New criteria for the switched time-varying delay system with unstable subsystem to be stable are obtained in Section 3. The controller design problem is solved in Section 4, while Section 5 gives an example to illustrate the effectiveness of the proposed approach. Finally, the conclusion is given in Section 6.

2. Modeling of the Wireless NCS

In practise, the sensors may be very far from the controller and actuators, for example [16], where the sensors and the controller are connected by a wireless network. The system structure is as in Figure 1.

As the wireless network is introduced into the system, the data, from the sensor to the controller, will be lost or delayed due to the disturbance in the environment and the limited transmission capacity of the wireless network. The graph of the system can be described as in Figure 2, where the system to be controlled is 𝑥(𝑘+1)=𝐴𝑥(𝑘)+𝐵𝑢(𝑘),(1)𝑥(𝑘)𝑛 is the system state, 𝑢(𝑘)𝑚 is the control input 𝑑𝑘 is the time-varying delay of the network, and 𝐾delay,loss is the controller to be designed, which depends on the time delay and packet loss, denoted as 𝐾𝑑,𝑠 in the graph for simplicity. The data loss in the network can be viewed as the behaviour results of a pair of switches [14]. If the switches are closed, the data is transmitted successfully (3), otherwise, the previous value will be used in the controller (2). Thus, the dynamics of the switches can be modeled as 𝑆𝑤(𝑘)=𝑤(𝑘1),(2)𝑥𝑆𝑥(𝑘)Notdelayed,𝑘𝑑𝑘Delayed.(3)

Without loss of generality, the following assumptions are made for the description of the system model.(A1)The sensors and controller are time driven.(A2)The data transmitted by the sensors are time stamped, so the controller can obtain the delay value of each data packet.(A3)The maximum delay in the network is 𝑑𝑀, where 𝑑𝑀 is a known integer.

Let 𝑥𝑧(𝑘)=𝑇(𝑘)𝑤𝑇(𝑘1)𝑇.(4) Then the dynamics of the closed-loop system can be described by the following subsystems.

Case 1. When the data is lost, the corresponding controller is denoted as 𝐾0,0, and the closed-loop system is described as Σ1𝑧(𝑘+1)=𝐴1𝑧(𝑘),𝐴1=𝐴𝐵𝐾0,00𝐼.(5)

Case 2. When the data is transmitted successfully without delay, the corresponding controller is denoted as 𝐾0,1, and the closed-loop system is described as Σ2𝑧(𝑘+1)=𝐴2𝑧(𝑘),𝐴2=𝐴+𝐵𝐾0,10𝐼0.(6)

Case 3. When the data is transmitted successfully with 𝑑𝑘-step delay, the corresponding controller is denoted as 𝐾𝑑𝑘,1, and the closed-loop system is described as Σ3𝑧(𝑘+1)=𝐴3𝑧(𝑘)+𝐴𝑑3𝑧𝑘𝑑𝑘,𝐴3=𝐴000,𝐴𝑑3=𝐵𝐾𝑑𝑘,10.𝐼0(7) So, the closed-loop system can be described as a system switched within three subsystems: Σ1, Σ2, and Σ3.
If 𝑑𝑘=0 in Σ3, then Σ3 becomes Σ2, and the difference of Σ2 and Σ1 is only the first element value of its system matrix. So, Case 3 includes Cases 1 and 2 by appropriately changing the value of the matrices. So the wireless networked control system can be represented by the following discrete-time switched system with time-varying delay: 𝑧(𝑘+1)=𝐴𝑖𝑧(𝑘)+𝐴𝑑𝑖𝑧𝑘𝑑𝑘𝑑,𝑖=1,2,3,𝑘=1,,𝑑𝑀,(8) where 𝐴𝑑1=𝐴𝑑2=0.
From above, it is easy to see that if the open system is unstable, when the data loss happens, the system will be uncontrollable, and the corresponding subsystem Σ1 is unstable.
The following lemma plays a crucial role in the proof of our main results.

Lemma 1 (see [23]). For any appropriately dimensioned matrices 𝑅=𝑅𝑇>0, 𝑌, 𝑋, and two positive integer time-varying 𝑑𝑘1, 𝑑𝑘2 satisfying 𝑑𝑘1+1𝑑𝑘2<𝑑𝑀, the following equality holds: 𝑘𝑑𝑘11𝑙=𝑘𝑑𝑘2𝜂𝑇(𝑙)𝑅𝜂(𝑙)=2𝜉𝑇𝑥(𝑘)𝑌𝑘𝑑k1𝑥𝑘𝑑𝑘2+𝑑𝑘2𝑑𝑘1𝜉𝑇(𝑘)𝑋𝜉(𝑘)𝑘𝑑𝑘11𝑙=𝑘𝑑𝑘2𝜉(𝑘)𝜂(𝑙)𝑇.𝑋𝑌𝑅𝜉(𝑘)𝜂(𝑙)(9)

3. Stability of the Switched System with Time-Varying Delay

As to the discrete-time switched system with time-varying delay, some results are obtained in the literature to test its stability [2430]. However, all the results above are obtained under the assumption that all the subsystems are stable and they cannot be applied here. So we will give criteria to test the stability of the discrete-time switched time-varying delay system with unstable subsystem in this section.

Consider the following discrete-time switched system with time-varying delay, 𝑧(𝑘+1)=𝐴𝑖𝑧(𝑘)+𝐴𝑑𝑖𝑧𝑘𝑑𝑘𝑑,𝑖=1,2,,𝑁.𝑘=1,,𝑑𝑀,(10) where 𝑁 is the number of the subsystems.

Choose the following Lyapunov function: 𝑉(𝑘)=𝑉1(𝑘)+𝑉2(𝑘)+𝑉3(𝑘)+𝑉4𝑉(𝑘),1(𝑘)𝑧𝑇𝑉(𝑘)𝑃𝑧(𝑘),2(𝑘)𝑘1𝑙=𝑘𝑑𝑘𝜆2(𝑙𝑘)𝑧𝑇(𝑙)𝑄1+𝑧(𝑙)0𝑚=𝑑𝑀+2𝑘1𝑙=𝑘+𝑚1𝜆2(𝑙𝑘)𝑧𝑇(𝑙)𝑄1𝑉𝑧(𝑙),3(𝑘)𝑘1𝑙=𝑘𝑑𝑀𝜆2(𝑙𝑘)𝑧𝑇(𝑙)𝑄2𝑉𝑧(𝑙),4(𝑘)1𝑚=𝑑𝑀𝑘1𝑙=𝑘+𝑚𝜆2(𝑙𝑘)𝜂𝑇(𝑙)𝑅𝜂(𝑙),(11) where 𝜂(𝑙)=𝜆1𝑧(𝑙+1)𝑧(𝑙).

In the following lemma, a criterion is given to guarantee that the Lyapunove function 𝑉(𝑘) exponentially decays or increases along any state trajectory of system (10).

Lemma 2. For a given scalar 𝜆>0 and any delay satisfying 0𝑑𝑑𝑀, if there exist symmetric positive definite matrices 𝑃, 𝑄1, 𝑄2, 𝑅, symmetric matrix 𝑋=𝑋1𝑋2𝑋30 and appropriate matrices 𝐺,𝑁=[𝑁𝑇1𝑁𝑇2]𝑇, 𝑀=[𝑀𝑇1𝑀𝑇2]𝑇, such that the following LMIs hold: Ψ𝑑𝑘=Ψ11Ψ12𝑁1𝑃+𝐴𝑖𝐺𝐼𝑇𝐺Ψ22𝑁2𝐴𝑑𝑖𝐺𝑇𝑄20𝑃+𝑑𝑀𝑅𝐺𝐺𝑇𝑑<0,𝑘=0,,𝑑𝑀𝑋𝑁𝑅>0,𝑋𝑀𝑅>0,(12) where Ψ11=𝑑𝑀𝑄1+𝑄2+𝑑𝑀𝑋1𝑀+Sym1+𝐺𝐴𝑇𝑖,Ψ𝐼12=d𝑀𝑋2+𝑁1𝑀1+𝑀𝑇2+𝐺𝐴𝑇𝑑𝑖,Ψ22=𝑄1+𝑑𝑀𝑋3𝑁+Sym2𝑀2,(13) and 𝐴𝑖=𝜆1𝐴𝑖, 𝐴𝑑𝑖=𝜆1𝑑𝑘𝐴𝑑𝑖, then 𝑉(𝑘)<𝜆2(𝑘𝑘0)𝑉𝑘0.(14)

Proof. See the appendix.

Remark 3. The last two terms of Δ𝑉4 are abandoned to obtain our result, which may introduce some conservatism. In order to reduce the conservatism, a free matrix 𝐺 is introduced.

Suppose that the rates of the corresponding subsystems are 𝑟1,𝑟2,,𝑟𝑁, which represent the fraction of time that each subsystem occurs, thus 𝑁𝑖=1𝑟𝑖=1. The following theorem gives a sufficient condition for the system (10) to be stable.

Theorem 4. The switched system with time-varying delay (10) is stable if there exist a Lyapunov function 𝑉(𝑘) and scalars 𝜆1,,𝜆𝑁 corresponding to each subsystem such that 𝑉(𝑘)<𝜆2(𝑘𝑘0)𝑖𝑉𝑘0,,𝑖=1,,𝑁𝑁𝑖=1𝜆𝑟𝑖𝑖<1.(15)

Proof. Suppose that the transition time of the subsystems is 𝑡1=0,𝑡2,,𝑡𝑘=𝑘, then 𝑉(𝑘)<𝜆𝑡𝑘𝑡𝑘1𝑡𝑘𝑉𝑡𝑘1<𝜆𝑡𝑘𝑡𝑘1𝑡𝑘𝜆𝑡𝑘1𝑡𝑘2𝑡𝑘1𝑉𝑡𝑘2<<𝑁𝑖=1𝜆𝑇𝑖𝑖𝑉(0),(16) where 𝑇𝑖 is the total time that one subsystem occurs and as 𝑘, 𝑟𝑖𝑘=𝑇𝑖. Thus, 𝑉(𝑘)<𝑁𝑖=1𝜆𝑇𝑖𝑖𝑉(0)=𝑁𝑖=1𝜆𝑟𝑖𝑖𝑘𝑉(0).(17) It is obvious that the system is stable if 𝑁𝑖=1𝜆𝑟𝑖𝑖<1, which completes the proof.

4. Controller Design for the Wireless NCS

In this section, the controller of the wireless networked control system is given using the criteria in Section 3. As the data packets are time stamped, and the packet loss and time delay are known to the controller, the controller is designed to depend on both the packet loss and time delay.

Theorem 5. The system (8) is stable if there exist scalars 𝜆𝑖, 𝑖=1,2,3, satisfying 3𝑖=1𝜆𝑟𝑖𝑖<1 and there exist 2𝑛×2𝑛 symmetric positive definite matrices 𝒫, 𝒬1, 𝒬2, , 𝒳1, 𝒳3, matrices 1, 2, 𝒩1, 𝒩2, 𝒳2 and 𝑛×𝑛 matrices 𝐺1, 𝐺2, 𝑚×𝑛 matrices 𝐾𝑔0,0, 𝐾𝑔0,1, 𝐾𝑔𝑑𝑘,1,𝑑𝑘=1,,𝑑𝑀 such that the following LMIs hold: Φ0+Φ1Φ<0,0+Φ2Φ<0,0+Φ3𝑑𝑘<0,𝑑𝑘=1,,𝑑𝑀,𝒳1𝒳2𝒩1𝒳3𝒩2𝒳>01𝒳21𝒳32>0,(18) whereΦ0=Θ11𝑑𝑀𝒳2+𝒩11+𝑇2𝒩1𝒫𝒢𝑇𝒢𝒬1+𝑑𝑀𝒳3𝒩+Sym22𝒩20𝒬20𝒫+𝑑𝑀𝒢𝒢𝑇,(19)Θ11=𝑑𝑀𝒬1+𝒬2+𝑑𝑀𝒳1+Sym1,𝐺+𝒢𝒢=100𝐺2,Φ1=Λ1100Λ14000000000000,Λ11=𝜆11𝐴𝐺𝑇1+𝐺1𝜆11𝐴𝑇𝐵𝐾𝑔0,0,Λ014=𝜆11𝐴𝐺𝑇1𝐵𝐾𝑔0,0,Φ002=Ω1100Ω14000000000000,Ω11=𝜆Sym21𝐴𝐺𝑇1+𝐵𝐾𝑔0,10,Ω014=𝜆21𝐴𝐺𝑇1+𝐵𝐾𝑔0,10,Φ003=Υ11Υ120Υ14000Υ2400000000,Υ11=𝜆31𝐴𝐺𝑇10,Υ0012=𝐾𝑔𝑑𝑘,1𝐵𝑇𝐺1,Υ0014=𝜆31𝐴𝐺𝑇1000,Υ24=𝐵𝐾𝑔𝑑𝑘,10𝐺𝑇10,(20) and the controllers are given by 𝐾0,0=𝐾𝑔0,0𝐺2𝑇,𝐾0,1=𝐾𝑔0,1𝐺1𝑇,𝐾𝑑𝑘,1=𝐾𝑔𝑑𝑘,1𝐺1𝑇,𝑑𝑘=1,,𝑑𝑀.(21)

Proof. Substituting the system matrices of (8) into (12) and letting 𝐾𝑔0,0=𝐾0,0𝐺𝑇2,𝐾𝑔0,1=𝐾0,1𝐺𝑇1,and 𝐾𝑔𝑑𝑘,1=𝐾𝑑𝑘,1𝐺𝑇1, it is easy to get the results according to Lemma 2 and Theorem 4.

Remark 6. The computing complexity of Theorem 5: the line number of the LMIs is (36𝑛+8𝑑𝑀𝑛) and the number of the scalar variables is (32𝑛2+5𝑛+3𝑚𝑛).

5. Numerical Example

In this section, an example is given to show the effectiveness of the proposed approach.

Consider the following discrete-time system: 111𝐴=0.88620.25860.50380.93110.89790.61280.19080.59340.8194,𝐵=.(22) The eigenvalues of 𝐴 are 1.8734, 0.3650+0.2369𝑖, and 0.36500.2369𝑖 and the system will diverge if there is no control. Suppose the event rates of the packet loss and time delay are 𝑟1=0.4, and 𝑟3=0.5 respectively, and the maximum delay is 𝑑𝑀=3, and choose 𝜆1=1.9,𝜆2=0.4, and 𝜆3=0.7. As 𝜆𝑟11𝜆𝑟22𝜆𝑟33=1.90.4×0.40.1×0.70.5=0.9869<1,(23) using Theorem 5, a feasible solution is given and the corresponding controllers are 𝐾0,0=0.00090.32950.2700×103,𝐾0,1=,𝐾0.77070.67720.74651,1=,𝐾0.57130.50480.55282,1=,𝐾0.39990.35330.38703,1=.0.27990.24730.2709(24) The simulation is shown in Figure 3. The first graph depicts the time delay and packet loss of the wireless network, if the delay value is −1, it means the packet is lost. The second graph is the trajectories of the closed-loop system. We can see that the trajectories of the system diverge at the instance when the packets are lost, while they converge to zeros at last, which proves the effectiveness of the proposed approach.

6. Conclusion

The stabilization problem for a wireless networked control system is studied in this paper. A new model is proposed to describe the system as a discrete-time switched system with time-varying delays. New criteria for the system to be stable with unstable subsystem are obtained, based on which, delay- and packet-loss-dependent controller is given to stabilize the system. A numerical example illustrates the effectiveness of the proposed approach.

Appendix

Proof of Lemma 2.

Proof. Applying the transformation 𝑧(𝑘)=𝜆(𝑘𝑘0)𝜉(𝑘),𝜆>0, we obtain the following system from (10): 𝜉(𝑘+1)=𝐴𝑖𝜉(𝑘)+𝐴𝑑𝑖𝜉𝑘𝑑𝑘𝑑,𝑖=1,2,,𝑁,𝑘=1,,𝑑𝑀,(A.1) where 𝐴𝑖=𝜆1𝐴𝑖 and 𝐴𝑑𝑖=𝜆1𝑑𝑘𝐴𝑑𝑖.
Choose the following Lyapunov function for system (A.1): 𝑊(𝑘)=𝑊1(𝑘)+𝑊2(𝑘)+𝑊3(𝑘)+𝑊4𝑊(𝑘),1(𝑘)𝜉𝑇𝑊(𝑘)𝑃𝜉(𝑘),2(𝑘)𝑘1𝑙=𝑘𝑑𝑘𝜉𝑇(𝑙)𝑄1𝜉(𝑙)+0𝑚=𝑑𝑀+2𝑘1𝑙=𝑘+𝑚1𝜉𝑇(𝑙)𝑄1𝜉𝑊(𝑙),3(𝑘)𝑘1𝑙=𝑘𝑑𝑀𝜉𝑇(𝑙)𝑄2𝑊𝜉(𝑙),4(𝑘)1𝑚=𝑑𝑀𝑘1𝑙=𝑘+𝑚𝛿𝑇(𝑙)𝑅𝛿(𝑙),(A.2) where 𝛿(𝑙)=𝜉(𝑙+1)𝜉(𝑙). Using Lemma 1, it is easy to obtain that Δ𝑊(𝑘)=𝜉𝑇(𝑘+1)𝑃𝜉𝑇(𝑘+1)𝜉𝑇(𝑘)𝑃𝜉(𝑘)+𝜉𝑇(𝑘)𝑄1𝜉(𝑘)+𝑘1𝑙=𝑘𝑑𝑘+1+1𝜉𝑇(𝑙)𝑄1𝜉(𝑙)𝑘1𝑙=𝑘𝑑𝑘+1𝜉𝑇(𝑙)𝑄1𝜉(𝑙)+𝜉𝑇(𝑘)𝑄2𝜉(𝑘)𝜉𝑇𝑘𝑑𝑀𝑄2𝜉𝑘𝑑𝑀+𝑑𝑀𝛿𝑇(𝑘)𝑅𝛿(𝑘)+𝑑𝑀𝜉𝜉(𝑘)𝑘𝑑𝑘𝑇𝑋𝜉𝜉(𝑘)𝑘𝑑𝑘𝜉+2𝜉(𝑘)𝑘𝑑𝑘𝑇𝑁1𝑁2𝜉𝑘𝑑𝑘𝜉𝑘𝑑𝑀𝜉+2𝜉(𝑘)𝑘𝑑𝑘𝑀1𝑀2𝜉(𝑘)𝜉𝑘𝑑𝑘𝑘𝑑𝑘1𝑙=𝑘𝑑𝑀𝜉𝜉(𝑘)𝑘𝑑𝑘𝛿(𝑙)𝑇𝜉𝑋𝑁𝑅𝜉(𝑘)𝑘𝑑𝑘𝛿(𝑙)𝑘1𝑙=𝑘𝑑𝑘𝜉𝜉(𝑘)𝑘𝑑𝑘𝛿(𝑙)𝑇𝜉𝑋𝑀𝑅𝜉(𝑘)𝑘𝑑𝑘𝑥𝛿(𝑙)+2𝑇(𝑘)+𝜂𝑇𝐺𝐴(𝑘)𝑇𝑖𝑥𝐼(𝑘)+𝐴𝑇𝑑𝑖𝑥𝑘𝑑𝑘𝜂(𝑘)<𝜁𝑇𝑑(𝑘)Ψ𝑘𝜁(𝑘)<0,(A.3) where 𝜁𝑇(𝑘)=[𝜉𝑇(𝑘)𝜉(𝑘𝑑𝑘)𝜉𝑇(𝑘𝑑𝑀)𝛿𝑇(𝑘)], which implies that 𝑊(𝑘)<𝑊(𝑘0) for any 𝑘𝑘0. Furthermore, 𝑉1(𝑘)=𝑧𝑇(𝑘)𝑃𝑧(𝑘)=𝜆2(𝑘𝑘0)𝜉𝑇(𝑘)𝑃𝜉(𝑘)=𝜆2(𝑘𝑘0)𝑊1𝑉(𝑘),2(𝑘)=𝑘1𝑙=𝑘𝑑𝑘𝜆2(𝑙𝑘)𝜆2(𝑙𝑘0)𝜉𝑇(𝑙)𝑄1+𝜉(𝑙)0𝑚=𝑑𝑀+2𝑘1𝑙=𝑘+𝑚1𝜆2(𝑙𝑘)𝜆2(𝑙𝑘0)𝜉𝑇(𝑙)𝑄1𝜉(𝑙)=𝜆2(𝑘𝑘0)𝑊2𝑉(𝑘),3(𝑘)=𝑘1𝑙=𝑘𝑑𝑀𝜆2(𝑙𝑘)𝜆2(𝑙𝑘0)𝜉𝑇(𝑙)𝑄2𝜉(𝑙)=𝜆2(𝑘𝑘0)𝑊3𝑉(𝑘),4(𝑘)1𝑚=𝑑𝑀𝑘1𝑙=𝑘+𝑚𝜆2(𝑙𝑘)𝜆2(𝑙𝑘0)𝛿𝑇(𝑙)𝑅𝛿(𝑙)=𝜆2(𝑘𝑘0)𝑊4(𝑘),(A.4) which means that 𝑉(𝑘)=𝜆2(𝑘𝑘0)𝑊(𝑘).
Noting that 𝑊(𝑘0)=𝑉(𝑘0), it is easy to verify that 𝑉(𝑘)<𝜆2(𝑘𝑘0)𝑉(𝑘0). This completes the proof.

Acknowledgments

This work is supported by the National Creative Research Groups Science Foundation of China under Grant 60721062, the National Natural Science Foundation of China under Grant 60736021, the National High Technology Research and Development Program of China under Grant 863 Program 2008AA042902, the National Natural Science Foundation of China under Grant 61004034, National Natural Science Foundation of China under Grant 61104102 and China Postdoctoral Science Foundation under Grant 20100480086.