# Switched Quantization Level Control of Networked Control Systems with Packet Dropouts

Authors: Shuo Wang; Mei Yu; Hangfei Wang; Wen Tan
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

This paper investigates the relationship between the maximum allowable dropout bound and the quantization density. Networked Control System (NCS) is described as a time-delay switched system with constrained switching signals. A switched dynamic output feedback controller with prescribed disturbance attenuation level is designed via a cone complement linearization approach. A novel stability criterion is obtained by switched system theory. Furthermore, finding an appropriate quantization density used when packet dropout occurs is converted to an optimization problem.


---

## Body

## 1. Introduction

Networked Control System (NCS) has been widely used in industrial production such as aerospace engineering, robotic engineering, and power system. The control information is exchanged via communication networks in NCS. It has many attractive advantages, such as less wiring, low costs, ease of system diagnosis and maintenance, and increased flexibility. On the contrary, it may induce some problems such as quantization error and packet dropouts which deteriorate the performance of system or even cause instability [1].Quantization effect cannot be avoided in the digital control process, and the stabilization problem by quantized feedback has been extensively studied in the last few years [2–5]. In [6], a sufficient condition is presented for filtering error system to be mean square exponentially stable with prescribed H
∞ performance by employing the multiple Lyapunov function method. The obtained condition depends on packet dropout rate of NCS. In [7], coarsest memoryless quantizer which can stabilize a single-input system with packet loss is proposed in the sense of stochastic quadratic stability. All of the aforementioned works use time-invariant signal quantization strategy and ignore network load condition. Actually, it is less conservative to switch quantization level according to network load condition. To achieve this, [8] proposes an adaptive quantization density method to reduce network congestion. The quantization density is designed to be a function of the networked load modeled by a Markov process. However, no specific parameters reflecting network load has been introduced. The Markov chain may not be obtained easily and might vary under some unknown disturbance. Packet loss is an important indicator for load condition and it can be measured easily by adding a counter at controller node. Therefore, packet loss number is treated as switching signal of load condition in our paper. A large packet loss number means that the network load condition is worse. A coarser quantization density which implies transmitting less information can decrease the incidence rates of packet drop. So the quantization density should be increased as much as possible in order to exchange for better network performance when successive packet dropouts occur. Nevertheless, the quantization density cannot be increased indefinitely for a specified number of packet loss because this may cause oscillation in system [9–12]. Hence, it is essential to investigate the relationship between packet loss number and quantization level.Many researchers have studied packet loss in NCS and lots of stability analysis results have been obtained [13–16]. For most of the aforementioned papers about packet loss problem, stochastic system approach is usually adopted to investigate the stability criterion of NCS. Generally, packet dropout process is modeled as an independent and identical distributed Bernoulli process [17–20]. It is easy to study the relationship between packet loss rate and quantization density by this method. However, this makes it difficult to add successive packet dropout number to the NCS model. The transition probability matrix or packet loss probability must be known beforehand by experimentation. The controller designed via stochastic system approach is constrained by packet loss probability. Once the probability changes, the controller should be redesigned, which reduces the flexibility. The quantitative relationship between packet dropouts number and quantization density has not been studied by switched system approach yet. Switched system approach is more flexible and independent of packet loss probability. This inspires us to try modeling the NCS as a switched linear discrete-time system.In this paper, the switched quantization strategy is set as follows: if the successive packet drop number increases, coarser quantization densities will be used at the next sampling time to relieve network congestion; a fine quantization density is selected when the data is transmitted successfully. An algorithm of a dynamic output feedback controller synthesis is proposed. A stability criterion dependent on quantization density and successive packet dropout number is given. The relationship between number of packet dropouts and quantization density is established through switched system theory. The structure of NCS proposed in this paper is depicted in Figure1.Figure 1
Structure of NCS.The advantage of the method presented in this paper is that the probability of packet loss need not be prior informed. Less experiments about network load mean that the costs of test and lots of time can be saved. The load condition of network can be dynamically optimized by transmitting less information when packet dropout happens. Fewer inequalities need to be solved since the constrained switching signal approach [21] is used to model the packet dropout. This greatly reduces the computation.Two assumptions are needed for designing the controller and quantization density as follows:(
1
) the network locates between the sensor and controller node; (
2
) if packet loss occurs, the actuator will use the last successful transmitted data.This paper is organized as follows. Section2 gives the system description, the form of dynamic output feedback controller, and quantization error model. Main results for controller synthesis and stability analysis are presented in Section 3. The validity of the approach is illustrated by a simulation example in Section 4. In Section 5, a summary for this paper is proposed.


## 2. System Modeling and Problem Formulation

Consider a discrete-time linear system model(1)
x
(
k
+
1
)
=
A
x
(
k
)
+
B
1
w
(
k
)
+
B
2
u
(
k
)
,
z
(
k
)
=
C
1
x
(
k
)
+
D
1
w
(
k
)
,
y
(
k
)
=
C
2
x
(
k
)
,
where x
(
k
)
∈
ℜ
n
,
u
(
k
)
∈
ℜ
m
,
z
(
k
)
∈
ℜ
m
1
,
y
(
k
)
∈
ℜ
m
2 are the state vector, input, controlled output, and measured output. w
(
k
) is the disturbance which belongs to l
2
[
0
,
∞
). A
,
B
1
,
B
2
,
C
1
,
C
2
,
D
1 are known matrices with appropriate dimensions.When the number of packet dropouts increases, the quantization density should be switched to reduce the network congestion. The logarithmic quantizer is proposed as follows:(2)
q
(
ν
,
σ
)
=
{
ρ
h
(
σ
)
if
1
1
+
δ
(
σ
)
ρ
h
(
σ
)
<
ν
m
m
m
m
m
m
m
j
m
≤
1
1
-
δ
(
σ
)
ρ
h
(
σ
)
,
ν
>
0
,
h
=
0
,
±
1
,
±
2
,
…
0
if
ν
=
0
,
-
q
(
-
ν
,
σ
)
if
ν
<
0
,
where ν is the signal to be quantized and q
(
ν
,
σ
) is the quantized signal. The introduction of variable σ aims to represent the switching signal of quantization density. 0
<
ρ
(
σ
)
<
1 is related to δ
(
σ
) by
(3)
δ
(
σ
)
=
1
-
ρ
(
σ
)
1
+
ρ
(
σ
)
.
The associated quantized set 𝒰 is given as
(4)
𝒰
=
{
±
ρ
h
(
σ
)
,
h
=
0
,
±
1
,
±
2
,
…
}
∪
{
0
}
.
The quantization error e
(
k
,
σ
) is proposed as follows:
(5)
e
(
k
,
σ
)
=
q
(
ν
(
k
)
,
σ
)
-
ν
(
k
)
=
Δ
q
(
σ
)
ν
(
k
)
,
Δ
q
(
σ
)
∈
[
-
δ
(
σ
)
,
δ
(
σ
)
]
,
σ
∈
{
0,1
,
…
,
d
}
,
where d is the maximum number of packet loss. According to the definition of Δ
q
(
σ
), it can be treated as norm-bounded time-varying uncertain parameter in NCS [22]. This means that
(6)
Δ
q
(
σ
)
=
H
F
E
,
where
(7)
H
=
1
,
E
=
δ
(
σ
)
,
F
T
F
≤
I
.
A switched dynamic output feedback (DOF) controller is used to compensate the packet dropouts as follows:
(8)
x
^
(
k
+
1
)
=
A
c
(
i
)
x
^
(
k
)
+
B
c
(
i
)
q
(
y
(
k
-
i
)
)
,
u
(
k
)
=
C
c
(
i
)
x
^
(
k
)
.Remark 1.
The variablei has two different meanings in the system. It stands for: (a) the switching signal of controller; (b) the successive dropout number of networked control system at instant (
k
+
1
)
T. The switching signal of quantizer is a map, σ
:
ℤ
+
↦
{
0,1
,
…
,
d
}.Remark 2.
In this paper, the switching signali is not arbitrary, but satisfies the following constraints. If the successive packet dropout number is i
-
1  (i
∈
{
1,2
,
…
,
d
}) at the present time, the number of consecutive packet loss is equal to i or 0 at the next instant; if the packet drop number is d at this instant, the data must be transmitted successfully at next sampling time.Now define a new state vectorξ
(
k
)
=
[
x
T
(
k
)
,
x
^
T
(
k
)
]
T. From (1), (5), and (8), the closed-loop system is given as follows:
(9)
ξ
(
k
+
1
)
=
A
cl
⁡
(
i
)
ξ
(
k
)
+
B
cl
⁡
(
i
)
(
1
+
Δ
q
(
σ
)
)
C
¯
2
ξ
(
k
-
i
)
+
B
¯
1
w
(
k
)
,
z
(
k
)
=
C
¯
1
ξ
(
k
)
+
D
1
w
(
k
)
,
where A
cl
⁡
(
i
)
=
[
A
B
2
C
c
(
i
)
0
A
c
(
i
)
], B
cl
⁡
(
i
)
=
[
0
B
c
(
i
)
], B
¯
1
=
[
B
1
0
], C
¯
2
=
[
C
2
0
], C
¯
1
=
[
C
1
0
].The problem under investigation is formulated as follows.(i)
For a prescribedγ
>
0 and quantization densities δ
(
σ
), design a switched DOF controller of the form (8) such that:
(1)
the system (9) is asymptotically stable with w
(
k
)
=
0;
(2)
under the zero-initial condition, the controlled outputz
(
k
) satisfies
(10)
∑
k
=
0
∞
‍
z
T
(
k
)
z
(
k
)
≤
γ
2
∑
k
=
0
∞
‍
w
T
(
k
)
w
(
k
)
for all nonzero w
(
k
).
(ii)
For anH
∞ controller obtained by the method above, select a maximum δ
(
σ
) in order to ease network congestion.The following lemmas will play a key role in designing the DOF controller for NCS.Lemma 3 (see [23]).
Define two new vectors:ξ
~
(
k
)
=
ξ
(
k
+
1
)
-
ξ
(
k
), η
(
k
)
=
[
ξ
T
(
k
)
,
ξ
T
(
k
-
i
)
,
w
T
(
k
)
]
T
∈
ℜ
4
n
+
1; then for any matrices R
∈
ℜ
2
n
×
2
n, M
∈
ℜ
2
n
×
(
4
n
+
1
), and Z
∈
ℜ
(
4
n
+
1
)
×
(
4
n
+
1
) satisfying
(11)
[
R
M
M
T
Z
]
≥
0
,
the following inequality holds
(12)
-
∑
j
=
k
-
i
k
-
1
‍
ξ
~
T
(
j
)
R
ξ
~
(
j
)
≤
η
T
(
k
)
{
Υ
1
+
Υ
1
T
+
i
Z
}
η
(
k
)
,
where Υ
1
=
M
T
[
I
,
-
I
,
0
].Lemma 4 (see [24]).
Assume thatH, F, E are real matrices with appropriate dimensions and F
T
F
≤
I. The inequality Y
+
H
F
E
+
E
T
F
T
H
T
<
0 holds if there exists a scalar ε
>
0  satisfying
(13)
Y
+
ε
-
1
E
T
E
+
ε
H
H
T
<
0
.


## 3. Controller Synthesis and Stability Analysis

The following theorem provides a methodology of designing a switched output feedback controller.Theorem 5.
For a given scalarγ
>
0 and quantization densities δ
(
σ
), if there exist positive symmetric matrices P
(
i
)
>
0, 𝒫
(
i
)
>
0, P
(
0
)
>
0, 𝒫
(
0
)
>
0, matrices R, R
1
∈
ℜ
2
n
×
2
n, M
1
∈
ℜ
2
n
×
2
n, M
2
∈
ℜ
2
n
×
2
n, M
3
∈
ℜ
2
n
×
1, Z
11
∈
ℜ
2
n
×
2
n, Z
12
∈
ℜ
2
n
×
2
n, Z
13
∈
ℜ
2
n
×
1, Z
22
∈
ℜ
2
n
×
2
n, Z
23
∈
ℜ
2
n
×
1, Z
33
∈
ℜ
1
×
1, A
c
(
0
), B
c
(
0
), C
c
(
0
), A
c
(
i
), B
c
(
i
), C
c
(
i
), scalar ε
>
0  satisfying the following inequalities for all i
∈
{
1
,
…
,
d
}:
(14)
[
R
1
M
1
M
2
M
3
*
Z
11
Z
12
Z
13
*
*
Z
22
Z
23
*
*
*
Z
33
]
≥
0
,
(15)
[
Φ
(
i
-
1
)
*
*
*
Γ
1
(
i
)
-
𝒫
(
i
)
*
*
i
Γ
2
(
i
)
0
-
i
R
*
0
C
¯
2
T
B
cl
⁡
T
(
i
)
i
C
¯
2
T
B
cl
⁡
T
(
i
)
-
ε
-
1
I
]
<
0
,
(16)
[
Λ
(
i
)
*
*
Π
1
(
0
)
-
𝒫
(
0
)
*
0
C
¯
2
T
B
cl
⁡
T
(
0
)
-
ε
-
1
I
]
<
0
,
(17)
[
Λ
(
0
)
*
*
Π
1
(
0
)
-
𝒫
(
0
)
*
0
C
¯
2
T
B
cl
⁡
T
(
0
)
-
ε
-
1
I
]
<
0
,
where(18)
Φ
(
i
-
1
)
=
[
-
P
(
i
-
1
)
+
C
¯
1
T
C
¯
1
+
M
1
+
M
1
T
+
i
Z
11
M
2
-
M
1
T
+
i
Z
12
C
¯
1
T
D
1
+
M
3
+
i
Z
13
*
ε
-
1
δ
2
(
d
)
I
-
M
2
-
M
2
T
+
i
Z
22
i
Z
23
-
M
3
*
*
D
1
T
D
1
-
γ
2
+
i
Z
33
]
,
Γ
1
(
i
)
=
[
A
cl
⁡
(
i
)
B
cl
⁡
(
i
)
C
¯
2
B
¯
1
]
,
Γ
2
(
i
)
=
[
A
cl
⁡
(
i
)
-
I
B
cl
⁡
(
i
)
C
¯
2
B
¯
1
]
,
Λ
(
i
)
=
[
-
P
(
i
)
+
C
¯
1
T
C
¯
1
+
ε
-
1
δ
2
(
i
)
I
C
¯
1
T
D
1
*
D
1
T
D
1
-
γ
2
]
,
Π
1
(
0
)
=
[
A
cl
⁡
(
0
)
+
B
cl
⁡
(
0
)
C
¯
2
B
¯
1
]
,
P
(
i
)
𝒫
(
i
)
=
I
,
P
(
0
)
𝒫
(
0
)
=
I
,
R
1
R
=
I
,
then the closed-loop system is stable with the prescribedH
∞ performance.Proof.
Construct a switched Lyapunov functionV
(
k
) for the closed-loop system as
(19)
V
(
k
)
=
ξ
T
(
k
)
P
(
i
-
1
)
ξ
(
k
)
+
∑
l
=
-
i
-
1
‍
∑
j
=
k
+
l
k
-
1
‍
ξ
~
T
(
j
)
R
1
ξ
~
(
j
)
.
Case
1. Assume that at times k
T and (
k
+
1
)
T, the numbers of packet loss arei
-
1 and i (1
≤
i
≤
d); then the forward difference of V
(
k
) is given as follows:
(20)
Δ
V
(
k
)
=
ξ
T
(
k
+
1
)
P
(
i
)
ξ
(
k
+
1
)
-
ξ
T
(
k
)
P
(
i
-
1
)
ξ
(
k
)
+
i
ξ
~
T
(
k
)
R
1
ξ
~
(
k
)
-
∑
j
=
k
-
i
k
-
1
‍
ξ
~
T
(
j
)
R
1
ξ
~
(
j
)
.
Using Lemma 3, the following inequality can be obtained:
(21)
Δ
V
(
k
)
=
η
T
(
k
)
Γ
~
1
T
(
i
)
P
(
i
)
Γ
~
1
(
i
)
η
(
k
)
-
ξ
T
(
k
)
P
(
i
-
1
)
ξ
(
k
)
+
i
η
T
(
k
)
Γ
~
2
T
(
i
)
R
1
Γ
~
2
(
i
)
η
(
k
)
-
∑
j
=
k
-
i
k
-
1
‍
ξ
~
T
(
j
)
R
1
ξ
~
(
j
)
≤
η
T
(
k
)
Γ
~
1
T
(
i
)
P
(
i
)
Γ
~
1
(
i
)
η
(
k
)
-
ξ
T
(
k
)
P
(
i
-
1
)
ξ
(
k
)
+
i
η
T
(
k
)
Γ
~
2
T
(
i
)
R
1
Γ
~
2
(
i
)
η
(
k
)
+
η
T
(
k
)
(
Υ
1
+
Υ
1
T
+
i
Z
)
η
(
k
)
+
η
T
(
k
)
Ψ
T
Ψ
η
(
k
)
-
γ
2
w
T
(
k
)
w
(
k
)
-
z
T
(
k
)
z
(
k
)
+
γ
2
w
T
(
k
)
w
(
k
)
,
where
(22)
Υ
1
=
M
T
[
I
,
-
I
,
0
]
,
Γ
~
1
(
i
)
=
[
A
cl
⁡
(
i
)
,
B
cl
⁡
(
i
)
(
1
+
Δ
q
(
σ
)
)
C
¯
2
,
B
¯
1
]
,
Γ
~
2
(
i
)
=
[
A
cl
⁡
(
i
)
-
I
,
B
cl
⁡
(
i
)
(
1
+
Δ
q
(
σ
)
)
C
¯
2
,
B
¯
1
]
,
Ψ
=
[
C
¯
1
,
0
,
D
1
]
.
Partition matrices M and Z as M
=
[
M
1
,
M
2
,
M
3
], Z
=
[
Z
11
Z
12
Z
13
*
Z
22
Z
23
*
*
Z
33
].
Applying Schur complement (see [25]) on (21), Δ
V
(
k
)
≤
-
z
T
(
k
)
z
(
k
)
+
γ
2
w
T
(
k
)
w
(
k
) is equivalent to the following matrix inequality:
(23)
[
Φ
~
(
i
-
1
)
*
*
Γ
~
1
(
i
)
-
P
-
1
(
i
)
*
i
Γ
~
2
(
i
)
0
-
i
R
1
-
1
]
<
0
,
where (24)
Φ
~
(
i
-
1
)
=
[
-
P
(
i
-
1
)
+
C
¯
1
T
C
¯
1
+
M
1
+
M
1
T
+
i
Z
11
*
*
-
M
1
+
M
2
T
+
i
Z
12
T
-
M
2
-
M
2
T
+
i
Z
22
*
D
1
T
C
¯
1
+
M
3
T
+
i
Z
13
T
-
M
3
T
+
i
Z
23
T
D
1
T
D
1
-
γ
2
+
i
Z
33
]
.
From (6), we know that
(25)
B
cl
⁡
(
i
)
Δ
q
(
σ
)
C
¯
2
=
B
cl
⁡
(
i
)
F
δ
(
σ
)
C
¯
2
.
Rewriting inequality (23), we can note that
(26)
[
Φ
~
(
i
-
1
)
*
*
Γ
1
(
i
)
-
P
-
1
(
i
)
*
i
Γ
2
(
i
)
0
-
i
R
-
1
]
+
[
0
B
~
cl
⁡
(
i
)
i
B
~
cl
⁡
(
i
)
]
F
[
δ
(
σ
)
I
~
0
0
]
+
[
δ
(
σ
)
I
~
T
0
0
]
F
T
[
0
B
~
cl
⁡
T
(
i
)
i
B
~
cl
⁡
T
(
i
)
]
<
0
,
where
(27)
I
~
=
[
0
I
0
]
,
B
~
cl
⁡
(
i
)
=
B
cl
⁡
(
i
)
C
¯
2
.
Applying Lemma 4 and Schur complement on the inequality above, (15) is easy to be obtained according to Δ
q
(
σ
)
≤
δ
(
σ
)
≤
δ
(
d
). This guarantees inequality (23). Adding Δ
V
(
k
) from 0 to ∞, the following result can be derived owing to the zero-initial condition (
V
(
0
)
=
0
):
(28)
V
(
∞
)
-
V
(
0
)
≤
∑
k
=
0
∞
‍
-
z
T
(
k
)
z
(
k
)
+
γ
2
w
T
(
k
)
w
(
k
)
.
This yields
(29)
∑
k
=
0
∞
‍
z
T
(
k
)
z
(
k
)
≤
γ
2
∑
k
=
0
∞
‍
w
T
(
k
)
w
(
k
)
.
When w
(
k
)
=
0, it is obvious that Δ
V
(
k
)
≤
0.
Case
2. At time k
T, the packet dropout number is i or 0. At time (
k
+
1
)
T, the packet is transmitted successfully. In this case, the second term of the Lyapunov functional becomes zero. Eliminate ξ
(
k
-
i
) in η
(
k
). Replacing P
(
i
) in (21) with P
(
0
) and P
(
i
-
1
), the proof is almost the same with that of Case 1. We can see that inequalities (16) and (17) guarantee the stabilization of NCS with prescribed H
∞ performance.A switched controller can be obtained by solving the Bilinear Matrix Inequalities in Theorem5. A cone complement approach shown as follows can be used to solve the problem [26]:
(30)
min
⁡
Tr
⁡
(
R
1
R
+
∑
i
=
0
d
‍
P
(
i
)
𝒫
(
i
)
)
subject
to
(
14
)
,
(
15
)
,
(
16
)
,
(
17
)
and
[
P
(
i
)
I
I
𝒫
(
i
)
]
≥
0
(
i
∈
{
0,1
,
…
,
d
}
)
,
[
R
1
I
I
R
]
≥
0
.For given controller matrices of system (9), a method of stability analysis is also needed in the sense of time-variant quantization density. Therefore, a novel stability criterion for system (9) with switched quantization level is proposed as follows. This method can also be used in choosing a suitable quantization density.Theorem 6.
For a prescribed scalari  (
i
=
1
,
…
,
d
), γ
>
0, controller matrices A
c
(
0
), B
c
(
0
), C
c
(
0
), A
c
(
i
), B
c
(
i
), C
c
(
i
), and quantization densities δ
(
σ
), if there exist sets of symmetric positive-definite matrices P
(
i
)
>
0, P
(
0
)
>
0, matrices R
1, Z
11, Z
12, Z
13, Z
22, Z
23, Z
33, M
1, M
2, M
3, scalar ε
>
0  satisfy the following inequalities:
(31)
[
R
1
M
1
M
2
M
3
*
Z
11
Z
12
Z
13
*
*
Z
22
Z
23
*
*
*
Z
33
]
≥
0
,
(32)
[
Θ
11
Θ
12
Θ
13
*
Θ
22
Θ
23
*
*
Θ
33
]
<
0
,
(33)
[
Ξ
11
Ξ
12
*
Ξ
22
]
<
0
,
(34)
[
Ξ
~
11
Ξ
12
*
Ξ
22
]
<
0
,
where
(35)
Θ
11
=
Φ
(
i
-
1
)
,
Θ
12
=
Γ
1
T
(
i
)
P
(
i
)
,
Θ
13
=
[
i
Γ
2
T
(
i
)
R
1
0
]
,
Θ
22
=
-
P
(
i
)
,
Θ
23
=
[
0
P
(
i
)
B
cl
⁡
(
i
)
C
¯
2
]
,
Θ
33
=
[
-
i
R
1
i
R
1
B
cl
⁡
(
i
)
C
¯
2
*
-
ε
-
1
I
]
,
Ξ
11
=
Λ
(
i
)
,
Ξ
12
=
[
Π
1
T
(
0
)
P
(
0
)
0
]
,
Ξ
22
=
[
-
P
(
0
)
P
(
0
)
B
cl
⁡
(
i
)
C
¯
2
*
-
ε
-
1
I
]
,
Ξ
~
11
=
Λ
(
0
)
,
the closed-loop system is asymptotically stable with the disturbance attenuation level γ.Proof.
Consider Case 1 in the proof of Theorem5. Multiply (15) to the right by the matrix diag
⁡
{
I
,
P
(
i
)
,
R
1
,
I
} and the left by its transpose. By Schur complement, if the inequalities (31) and (32) hold, then the inequality (23) holds [27]. Thus the closed-loop system is asymptotically stable with the disturbance attenuation level γ.
Case 2: Pre- and postmultiply (16) and (17) by diag{
I
,
P
(
0
)
,
I
}; then if (33) and (34) hold, the closed-loop system is asymptotically stable with the disturbance attenuation level γ. The proof is similar to that of Case 1.After designing a switchedH
∞ controller, a δ
(
d
) that is large enough should be selected to reduce the packet dropouts. This can be converted to a convex optimization problem as follows:
(36)
max
⁡
δ
(
d
)
subject
to
inequalities
(
31
)
,
(
32
)
,
(
33
)
,
(
34
)
in
Theorem
6
.Remark 7.
The quantization density for the worst packet loss caseδ
(
d
) can be increased until the LMIs are infeasible. The maximum δ
(
d
) can be used to quantize the data transmitted to the controller when the load condition takes a turn for the worse. By the approach proposed in this paper, we not only design a less conservative controller by changing quantization level when network load is heavy but also search for an optimized quantization density.


## 4. Numerical Examples

In this section, the numerical simulation is given to illustrate the main results in this paper.Consider the following example of a discrete-time LTI system (1), where
(37)
A
=
[
0.08
-
0.025
0
1
1
0
0
0
-
0.8
0.5
0.002
-
0.03
0
0
0.0792
0
]
,
B
1
=
[
0
0.1
0
0.05
]
,
B
2
=
[
1
0
0
0
]
,
C
1
=
[
0
0.1
0
0
]
,
C
2
=
[
4.5
-
4.5
0
2
]
,
D
1
=
0.03
.The maximum number of packet loss is assumed to be 3. For the simplicity of presentation, the switched output feedback controller is designed to have two modes{
0,1
}. 0 represents that there is no packet dropout at this time, whereas 1 means that packet loss happens. Set the initial value of quantization density as δ
(
0
)
=
0.02, δ
(
1
)
=
0.04. γ
=
0.95 is chosen for the design of controller. Using the approach given in Theorem 5, the controller matrices are obtained as follows:
(38)
A
c
(
0
)
=
[
-
0.0304
-
0.1710
-
0.1544
0.0041
0.1589
0.1676
0.0222
-
0.1436
-
0.1773
-
0.0481
0.1254
0.1836
0.0730
-
0.1047
-
0.1861
-
0.0964
]
,
B
c
(
0
)
=
[
0.0059
0.0133
0.0085
-
0.0041
]
,
C
c
(
0
)
=
[
-
0.1794
-
0.1404
0.0277
0.1704
]
,
A
c
(
1
)
=
[
0.5117
-
0.0017
-
0.0517
-
0.0568
-
0.0068
0.5088
0.0601
0.0145
-
0.0419
-
0.0606
0.4383
0.0358
0.0615
0.0314
-
0.0276
0.4012
]
,
B
c
(
1
)
=
[
-
0.0035
0.0017
0.0053
0.0040
]
,
C
c
(
1
)
=
[
-
0.0143
-
0.0731
-
0.0648
0.0032
]
.After designing a switched output feedback controller, a suitableδ
(
σ
) should be selected according to the method given above. Solving inequalities (31), (32), (33), and (34) in Theorem 6, we can find that the LMIs are still feasible when δ
(
1
)
=
0.07 and γ
=
0.197 which is smaller than the prescribed 0.95. This means that the quantization density can be switched to 0.07 when network load is heavy. The network congestion can be reduced. The states evolution of system is shown in Figures 2, 3, 4, and 5.Figure 2
StateX
1.Figure 3
StateX
2.Figure 4
StateX
3.Figure 5
StateX
4.To compare with the case of fixed quantization density,δ
=
0.07 which corresponds to heavy load is adopted for quantizing data. In this case, network load condition is ignored for design of the controller. A fixed quantization density implies that the load condition cannot be dynamically optimized and the control law can only be computed for the worst load condition. Using Theorem 5, no feasible solution can be found with this density. This indicates that the proposed approach is less conservative.


## 5. Conclusions

The quantitative relationship between quantization density and packet loss number has been studied by switched system approach in this paper. A robustH
∞ feedback control law has been derived in terms of bilinear matrix inequalities which can be solved by a cone complement algorithm. A new method for stability analysis of NCS with quantization error and packet drop has been given in the form of Linear Matrix inequalities. An approach to choose suitable quantization density δ
(
d
) has been presented. The result is less conservative but more flexible since a switched controller and quantization level are used. The effectiveness of the method is illustrated by a simulation example.



---

*Source: 890543-2014-03-12.xml*