# Sampled-Data Control of Nonlinear Systems with Quantization

Authors: Liu Cui; Dengping Duan
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

This paper is concerned with sampled-data control problem for a class of nonlinear systems with input quantization. The nonlinear system is converted into a linear-like system with modeling error by using partition of unity method. A time-dependent Lyapunov functional is introduced to capture the characteristic of nonlinear sampled-data systems and the exponential stability conditions are derived by the use of inequality techniques. The desired sampled-data controller is then synthesized. An example is provided to illustrate the effectiveness and benefits of the proposed scheme.


---

## Body

## 1. Introduction

In modern control systems, such as computer-based control systems, the continuous-time plant is usually controlled by a discrete-time controller with sample and hold devices. Such control systems are referred to as sampled-data systems. The analysis and synthesis of sampled-data systems have been a research focus for nearly three decades and many results have been reported in the literature; see, for example, [1–5] and the references therein. Among these references, lifting technique method and impulse model method are two main approaches. In the past years, some papers have considered the modeling of continuous-time systems with sampled-control in the form of continuous-time systems with delayed control input, which was introduced in [6]. Compared with the other two approaches, this input delay approach can be applied to systems with nonuniform uncertain sampling and can cope with the system with parameter uncertainties. Many results related to this approach have been reported in the literature. For example, stabilization and stability analysis were investigated in [7–13], and filtering problems were addressed in [14, 15]. Improvements were provided in [16–20], where new time-dependent Lyapunov-Krasovskii functionals (LKFs) were defined to capture the characteristic of sampled-data systems.The aforementioned results about sampled-data systems are mainly on linear systems or linear systems with nonlinear terms because the nonlinear dynamics are extremely difficult to deal with. Most of the existing results for nonlinear sampled-data systems are based on certain T-S fuzzy models. The T-S fuzzy model-based technique is an efficient approach for taking advantage of modern linear sampled-data control theory to nonlinear control. In [21–26], based on input delay approach, the considered systems were simply treated as ordinary continuous-time systems with a bounded fast-varying delay. The work in [27, 28] has improved the results by applying an improved Lyapunov functional, which captures the characteristic of fuzzy sampled-data systems. It should be pointed out that the fuzzy controller design is based on the assumption that the fuzzy model exactly matches the plant and the modeling error may be neglected despite that the existence of modeling error may cause the instability of the system [29].On the other hand, partition of unity is an important concept in differential geometry and is close to a group of open covering sets. The partition of unity method has proved that certain finite linear combinations of partition of unity have the ability to approximate continuous functions at any arbitrary precision on a compact region of Euclid space, which was first introduced in [30]. When a nonlinear system is well approximated by using partition of unity, the remaining control problems become easier [31]. Compared with T-S fuzzy approach, the main difference lies in that the former is more flexible in the modeling of nonlinear systems. In addition, the fuzzy method ignores the modeling error, while partition of unity method yields an equivalent model with modeling error, which may better represent the characteristics of the origin nonlinear system. Recently, the control problem for nonlinear systems approximated by using partition of unity has gained some scattered research attention [31–33]. However, there rarely exists published work addressing sampled-control problem for nonlinear systems approximated by using partition of unity method despite its potential in practical applications. It is, therefore, an important purpose of this paper to close such a gap by making the first challenge to deal with the sampled-data control problem for a class of nonlinear systems approximated by using partition of unity method.On the other hand, the aforementioned publications do not take into account the quantizer effects. In real computer-based control systems, quantization is an indispensable step because data transmissions cannot be performed with infinite precision due to the limited communication capacity [34–36]. On this account, some efforts have been made on sampled-data control with quantization. In [37–39], the periodic sampling technique was used to obtain a discrete-time system for modeling the real plant. However, such a discrete-time model might not capture the intersample behavior of the real system, especially for the case when the sampling period is not periodic. To the best of our knowledge, the sampled-control problem with quantization has not been fully investigated, especially for nonlinear systems with variable sampling period.Motivated by the above discussions, in this paper, we aim to investigate the sampled-data control problem for a class of affine nonlinear systems with quantization. Following the idea of [31–33], partition of unity method is adopted to transform the nonlinear system into an equivalent linear-like system with modeling error. Based on the proposed time-dependent Lyapunov functional, sufficient conditions have been presented for the existence of desired sampled-data controller. The main contribution of this paper is mainly threefold: (
1
) the problem addressed is new in the sense that this paper represents the first of few attempts to deal with sampled-data control for nonlinear systems by using partition of unity method; (
2
) quantization and variable sampling are considered simultaneously; and (
3
) an LMI framework based quantized sampled-data controller design scheme is proposed for nonlinear systems. An example is given to show the effectiveness of the proposed method.


## 2. Problem Formulation

Consider the following nonlinear system:(1)
x
˙
t
=
F
x
t
x
t
+
G
x
t
u
t
,where x
(
t
)
∈
U
-
⊂
R
n is the state vector and U
- is a compact set in R
n; input u
(
t
)
∈
R
m; F
(
x
)
=
f
i
j
(
x
)
n
×
n and G
(
x
)
=
g
i
j
(
x
)
n
×
m are function matrices defined on U
-.Assumption 1.
F
(
x
)
=
f
i
j
(
x
)
n
×
n and G
(
x
)
=
g
i
j
(
x
)
n
×
m are continuous on ⋃
j
=
1
N
U
j, where U
i, i
=
1
,
…
,
N, is an open covering of U
-.Lemma 2 (see [30]).
Form given real continuous functions ξ
i
=
ξ
i
(
x
) defined in a compact domain U
-
⊂
R
n and m arbitrary scalars ε
i
>
0  (
1
≤
i
≤
m
), there exists a partition of unity α
j, j
=
1,2
,
…
,
N, subordinated to the open covering U
i of the compact region U
-
⊂
R
n and m
×
N real numbers γ
i
j, such that(2)
sup
⁡
x
∈
U
-
ξ
i
(
x
)
-
∑
j
=
1
N
γ
i
j
α
j
(
x
)
<
ε
i
.Now, we rewrite system (1) into a mathematically equivalent linear-like system with modeling error using Lemma 2.From Lemma2, for every continuous function f
i
j
(
x
) or g
i
l
(
x
),  i
,
j
=
1
,
…
,
n,  l
=
1
,
…
,
m, there exists an open covering U
i of U
-
⊂
R
n and a partition of unity subordinated to it, such that(3)
f
i
j
x
=
∑
k
=
1
N
λ
i
j
k
α
k
x
+
e
i
j
x
,
g
i
l
x
=
∑
k
=
1
N
λ
-
i
l
k
α
k
x
+
e
-
i
l
x
,where e
i
j
(
x
), e
-
i
l
(
x
) are approximation errors, satisfying(4)
sup
⁡
x
∈
U
-
e
i
j
(
x
)
<
ε
i
j
,
sup
⁡
x
∈
U
-
e
-
i
l
(
x
)
<
ε
-
i
l
,where ε
i
j
>
0, ε
-
i
l
>
0.Chooseλ
i
j
k
=
f
i
j
(
x
k
), λ
-
i
l
k
=
g
i
l
(
x
k
), where x
k is a group of sample values subordinated to open covering U
k, respectively, x
k
=
x
k
1
,
…
,
x
k
n
T, and k
∈
R
=
1
,
…
,
N, i
=
1
,
…
,
n, l
=
1
,
…
,
m.From (3), we obtain(5)
F
x
=
f
i
j
(
x
)
n
×
n
=
∑
k
=
1
N
λ
i
j
k
α
k
(
x
)
+
e
i
j
(
x
)
n
×
n
=
∑
k
=
1
N
α
k
x
A
k
+
e
i
j
x
n
×
n
,
G
x
=
g
i
l
(
x
)
n
×
m
=
∑
k
=
1
N
λ
i
l
k
α
k
(
x
)
+
e
i
l
(
x
)
n
×
m
=
∑
k
=
1
N
α
k
x
B
k
+
e
-
i
l
x
n
×
m
,where A
k
=
λ
i
j
k
n
×
n, B
k
=
λ
-
i
l
k
n
×
m. Then, system (1) can be converted into the following equivalent linear model with error:(6)
x
˙
(
t
)
=
∑
k
=
1
N
α
k
x
A
k
x
t
+
B
k
u
t
+
e
,where the error vector e
=
e
i
j
(
x
)
n
×
n
x
(
t
)
+
e
-
i
l
(
x
)
n
×
m
u
(
t
).Remark 3.
If the open coveringU
k of a compact U
- in (3) is composed of some rectangular domains U
k
=
∏
i
=
1
n
(
a
i
k
,
b
i
k
), k
=
1
,
…
,
N, the partition of unity α
k subordinated to U
k can be chosen as the following collection of C
∞ functions α
k
(
x
)
=
g
k
(
x
)
/
∑
k
=
1
N
g
k
(
x
), where the function g
k
(
x
)
=
∏
i
=
1
n
g
i
k
(
x
i
),(7)
g
i
(
x
i
)
=
e
-
1
/
x
i
-
a
i
+
1
/
b
i
-
x
i
2
,
x
i
∈
(
a
i
,
b
i
)
0
,
x
i
∉
a
i
,
b
i
.
For more details, say, for example, the open coveringU
k is composed of some open sphere domains or some open rectangular domains and open sphere domains together; one may refer to [22].Assumption 4.
e
i
j
(
x
)
n
×
n, e
-
i
l
(
x
)
n
×
m are norm-bounded and satisfy (8)
e
i
j
(
x
)
n
×
n
≤
a
,
e
-
i
l
x
n
×
m
≤
b
,where a and b are positive real constants.
For sampled-data control, only discrete measurements ofx
(
t
) are available for control purposes, and the control signal is assumed to be generated by using a zero-order-hold (ZOH) function with a sequence of hold times(9)
0
=
t
0
<
t
1
<
⋯
<
t
k
<
⋯
<
lim
k
→
+
∞
⁡
t
k
=
+
∞
.
Moreover, the sampling is not required to be periodic, and the only assumption is that the distance between any two consecutive sampling instants belongs to an interval. Specifically, it is assumed that(10)
t
k
+
1
-
t
k
=
h
k
∈
h
1
,
h
2
.
For allk
≥
0, where h
2
≥
h
1
>
0 represents the upper and lower bounds of sampling interval, respectively.In this paper, we propose the following state feedback controller:(11)
u
t
=
∑
j
=
1
N
α
j
x
K
j
x
t
k
t
k
≤
t
<
t
k
+
1
.It is assumed that the output signals of controller (11) are passed via a quantizer and the quantizer is denoted as f
(
·
)
=
f
1
(
·
)
,
f
2
(
·
)
,
…
,
f
m
(
·
)
T, which is assumed to be symmetric; that is, f
(
-
ν
)
=
-
f
(
ν
). The set of quantized levels is described by (12)
R
=
±
u
i
,
i
=
0
,
±
1
,
±
2
,
…
∪
0
.Theoretically, many different forms are possible for a quantizer. There is always a need to find a compromise between the performance and simplicity for real-world sampled-data control applications. In this paper, we are interested in logarithmic static and time-invariant quantizer, which is relatively simple and suitable for sampled-data systems. According to [40, 41], a quantizer is called logarithmic if the set of quantized levels is characterized by(13)
R
=
±
u
i
,
u
i
=
ρ
i
u
0
,
i
=
0
,
±
1
,
±
2
,
…
∪
±
u
0
∪
0
lllllllllllllllllllllllllllllllllllllllllllllll
0
<
ρ
i
<
1
u
0
>
0
.For the logarithmic quantizer, the associated quantizerf
(
·
) is defined as follows:(14)
f
(
ν
)
=
u
i
,
if
1
1
+
σ
u
i
<
ν
≤
1
1
-
σ
u
i
,
ν
>
0
,
0
,
if
ν
=
0
,
-
f
(
ν
)
,
if
ν
<
0
,where(15)
σ
=
1
-
ρ
1
+
ρ
.Then, considering the above quantization behavior, we obtain the following quantized sampled-data controller:(16)
u
-
t
=
I
+
Λ
∑
j
=
1
N
α
j
x
K
j
x
t
k
,where Λ
=
diag
Λ
1
,
Λ
2
,
…
,
Λ
m and Λ
s
∈
-
σ
,
σ, s
=
1
,
…
,
m.Substituting the quantized controller (16) into (6), we obtain the following closed-loop system:(17)
x
˙
t
=
∑
i
=
1
N
∑
j
=
1
N
α
i
(
x
)
α
j
(
x
)
A
i
x
t
+
B
i
I
+
Λ
K
j
x
(
t
k
)
+
e
llllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll
t
k
≤
t
<
t
k
+
1
,where e
=
e
i
j
(
x
)
n
×
n
x
(
t
)
+
e
-
i
j
(
x
)
n
×
m
(
I
+
Λ
)
K
j
x
(
t
k
).The goal of this paper is to design quantized sampled-data controller (16) to make the closed-loop system (17) be exponentially stable; that is, there exist two constants α
>
0 and β
>
0 such that(18)
x
(
t
)
≤
β
e
-
α
t
x
0
,
∀
t
≥
0
.Throughout this paper, the following lemma will be used.Lemma 5.
Considering system (17), the following inequality holds:(19)
x
(
t
)
2
≤
ϑ
x
t
k
2
,
t
k
≤
t
<
t
k
+
1
,where ϑ
1
=
max
⁡
i
∈
R
B
i, ϑ
2
=
max
⁡
i
∈
R
K
i, ϑ
3
=
max
⁡
i
∈
R
A
i, and ϑ
=
5
1
+
(
1
+
σ
)
h
2
2
ϑ
1
ϑ
2
+
(
1
+
σ
)
b
2
h
2
2
ϑ
2
e
5
(
a
2
+
ϑ
3
)
h
2
2.Proof.
For anyt
∈
t
k
,
t
k
+
1, we obtain from (17) that (20)
x
(
t
)
≤
∫
t
k
t
∑
i
=
1
N
∑
j
=
1
N
α
i
(
x
)
α
j
(
x
)
B
i
(
I
+
Λ
)
K
j
x
(
t
k
)
d
θ
+
x
(
t
k
)
+
∫
t
k
t
∑
i
=
1
N
α
i
(
x
)
A
i
x
(
θ
)
d
θ
+
∫
t
k
t
e
i
j
x
n
×
n
x
θ
d
θ
+
∫
t
k
t
e
-
i
j
x
n
×
m
I
+
Λ
K
j
x
t
k
d
θ
.
Applying the Cauchy-Schwarz inequality, we find from (20) that(21)
x
(
t
)
2
≤
5
∫
t
k
t
∑
i
=
1
N
∑
j
=
1
N
α
i
(
x
)
α
j
(
x
)
B
i
(
I
+
Λ
)
K
j
x
(
t
k
)
d
θ
2
+
5
x
(
t
k
)
2
+
5
∫
t
k
t
∑
i
=
1
N
α
i
(
x
)
A
i
x
(
θ
)
d
θ
2
+
5
∫
t
k
t
e
i
j
(
x
)
n
×
n
x
(
θ
)
d
θ
2
+
5
∫
t
k
t
e
-
i
j
x
n
×
m
I
+
Λ
K
j
x
t
k
d
θ
2
.
Using the Cauchy-Schwarz inequality again, we have(22)
x
(
t
)
2
≤
5
h
2
∫
t
k
t
∑
i
=
1
N
∑
j
=
1
N
α
i
(
x
)
α
j
(
x
)
B
i
(
I
+
Λ
)
K
j
x
(
t
k
)
2
d
θ
+
5
x
(
t
k
)
2
+
5
h
2
∫
t
k
t
∑
i
=
1
N
α
i
(
x
)
A
i
x
(
θ
)
2
d
θ
+
5
h
2
∫
t
k
t
e
i
j
(
x
)
n
×
n
x
(
θ
)
2
d
θ
+
5
h
2
∫
t
k
t
e
-
i
j
x
n
×
m
I
+
Λ
K
j
x
t
k
2
d
θ
.Thus,(23)
x
(
t
)
2
≤
5
(
1
+
σ
)
h
2
ϑ
1
ϑ
2
∫
t
k
t
x
(
t
k
)
2
d
θ
+
5
x
(
t
k
)
2
+
5
h
2
ϑ
3
∫
t
k
t
x
(
θ
)
2
d
θ
+
5
a
2
h
2
∫
t
k
t
x
(
θ
)
2
d
θ
+
5
1
+
σ
b
2
h
2
ϑ
2
∫
t
k
t
x
t
k
2
d
θ
≤
5
1
+
1
+
σ
h
2
2
ϑ
1
ϑ
2
+
1
+
σ
b
2
h
2
2
ϑ
2
x
t
k
2
+
5
a
2
+
ϑ
3
h
2
∫
t
k
t
x
θ
2
d
θ
.
Applying the Gronwall-Bellman lemma, we can conclude that (19) holds. This completes the proof.


## 3. Main Results

In this section, the problem of quantized sampled-data control will be studied for nonlinear systems by using partition of unity. Some results are provided as follows.Theorem 6.
Consider system (1) satisfying Assumptions 1 and 4, for given scalar λ
>
0, if there exist matrices P
>
0, U
>
0, R
1
R
2
∗
R
3
>
0, X
1, X
2, X
3, X
4, X
5, G
1, G
2, and H
i
j
=
[
H
1
i
j
H
2
i
j
H
3
i
j
H
4
i
j
] and constants γ
1
>
0, γ
2
>
0, γ
3
>
0, and γ
4
>
0 such that, for any i
,
j
∈
R, the following two equations hold:(24)
Φ
1
i
j
(
h
-
)
=
Ξ
11
i
j
+
Θ
11
h
-
Ξ
12
i
j
+
Θ
12
h
-
Ξ
13
i
j
+
Θ
13
h
-
Ξ
14
i
j
+
Θ
14
h
-
∗
Ξ
22
i
j
+
h
-
U
Ξ
23
i
j
+
Θ
23
h
-
h
-
X
3
∗
∗
Ξ
33
i
j
+
Θ
33
h
-
Ξ
34
i
j
+
2
λ
h
-
X
4
∗
∗
∗
Ξ
44
i
j
+
Θ
44
h
-
<
0
,
(25)
Φ
2
i
j
(
h
-
)
=
Ξ
11
i
j
Ξ
12
i
j
Ξ
13
i
j
Ξ
14
i
j
∗
Ξ
22
i
j
Ξ
23
i
j
0
∗
∗
Ξ
33
i
j
Ξ
34
i
j
∗
∗
∗
Ξ
44
i
j
+
h
-
H
1
i
j
T
H
2
i
j
T
H
3
i
j
T
H
4
i
j
T
e
2
λ
h
2
U
-
1
H
1
i
j
T
H
2
i
j
T
H
3
i
j
T
H
4
i
j
T
T
<
0
,
lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll
h
-
=
h
1
,
h
2
,where(26)
Ξ
11
i
j
=
2
λ
P
+
H
1
i
j
+
H
1
i
j
T
-
X
1
+
X
1
T
2
+
G
1
A
i
+
A
i
T
G
1
T
+
(
γ
1
+
γ
2
)
G
1
G
1
T
+
a
2
γ
1
-
1
I
+
a
2
γ
3
-
1
I
,
Ξ
12
i
j
=
P
+
H
2
i
j
+
H
1
i
j
T
-
G
1
+
A
i
T
G
2
T
,
Ξ
13
i
j
=
X
1
-
X
2
+
H
3
i
j
-
H
1
i
j
T
+
G
1
B
i
I
+
Λ
K
j
,
Ξ
14
i
j
=
-
X
3
+
H
4
i
j
,
Ξ
22
i
j
=
-
G
2
-
G
2
T
+
γ
3
+
γ
4
G
2
G
2
T
,
Ξ
23
i
j
=
-
H
2
i
j
T
+
G
2
B
i
I
+
Λ
K
j
,
Ξ
33
i
j
=
X
2
+
X
2
T
-
X
1
+
X
1
T
2
-
H
3
i
j
-
H
3
i
j
T
+
b
2
γ
2
-
1
K
j
T
I
+
Λ
T
(
I
+
Λ
)
K
j
+
b
2
γ
4
-
1
K
j
T
I
+
Λ
T
I
+
Λ
K
j
,
Ξ
34
i
j
=
-
X
4
-
e
-
2
λ
h
2
R
2
T
-
H
4
i
j
,
Ξ
44
i
j
=
-
X
5
+
X
5
T
2
-
e
-
2
λ
h
2
h
2
R
1
,
Θ
11
i
j
(
h
-
)
=
λ
h
-
(
X
1
+
X
1
T
)
+
h
-
R
1
+
h
-
X
3
+
h
-
X
3
T
,
Θ
12
i
j
(
h
-
)
=
h
-
X
1
+
X
1
T
2
,
Θ
13
i
j
(
h
-
)
=
2
λ
h
-
(
-
X
1
+
X
2
)
+
h
-
R
2
+
h
-
X
4
T
,
Θ
14
i
j
(
h
-
)
=
2
λ
h
-
X
3
+
h
-
X
5
+
X
5
T
2
,
Θ
23
i
j
h
-
=
h
-
-
X
1
+
X
2
,
Θ
33
i
j
(
h
-
)
=
2
λ
h
-
-
X
2
+
X
2
T
+
X
1
+
X
1
T
2
+
h
-
R
3
-
h
-
e
-
2
λ
h
2
R
3
,
Θ
44
i
j
h
-
=
λ
h
-
X
5
+
X
5
T
.
Then, system (1) is exponentially stable.Proof.
Consider the following Lyapunov functional for system (17):(27)
V
t
=
∑
l
=
1
4
V
l
t
,
t
k
≤
t
<
t
k
+
1
,where(28)
V
1
t
=
e
2
λ
t
x
T
t
P
x
t
,
V
2
t
=
t
k
+
1
-
t
∫
t
k
t
e
2
λ
s
x
˙
T
s
U
x
˙
s
d
s
,
V
3
t
=
t
k
+
1
-
t
∫
t
k
t
e
2
λ
s
x
s
x
t
k
T
R
1
R
2
∗
R
3
x
s
x
t
k
d
s
,
V
4
(
t
)
=
(
t
k
+
1
-
t
)
e
2
λ
t
x
(
t
)
x
(
t
k
)
∫
t
k
t
x
(
s
)
d
s
T
H
x
(
t
)
x
(
t
k
)
∫
t
k
t
x
(
s
)
d
swith(29)
H
=
X
1
+
X
1
T
2
-
X
1
+
X
2
X
3
∗
-
X
2
+
X
2
T
+
X
1
+
X
1
T
2
X
4
∗
∗
X
5
+
X
5
T
2
.
Note thatV
2
(
t
), V
3
(
t
), and V
4
(
t
) vanish before t
k and after t
k. So, V
(
t
) is continuous in time since lim
t
→
t
k
V
(
t
)
=
V
(
t
k
).
Calculating the derivative ofV
(
t
) along the trajectories of (17), we obtain(30)
V
˙
1
t
=
2
λ
e
2
λ
t
x
T
t
P
x
t
+
2
e
2
λ
t
x
T
t
P
x
˙
t
,
V
˙
2
(
t
)
=
(
t
k
+
1
-
t
)
e
2
λ
t
x
˙
T
(
t
)
U
x
˙
(
t
)
-
∫
t
k
t
e
2
λ
s
x
˙
T
(
s
)
U
x
˙
(
s
)
d
s
≤
t
k
+
1
-
t
e
2
λ
t
x
˙
T
t
U
x
˙
t
-
∫
t
k
t
e
2
λ
t
k
x
˙
T
s
U
x
˙
s
d
s
≤
(
t
k
+
1
-
t
)
e
2
λ
t
x
˙
T
(
t
)
U
x
˙
(
t
)
-
e
2
λ
t
∫
t
k
t
e
-
2
λ
h
x
˙
T
s
U
x
˙
s
d
s
,
V
˙
3
(
t
)
=
-
∫
t
k
t
e
2
λ
s
x
(
s
)
x
(
t
k
)
T
R
1
R
2
∗
R
3
x
(
s
)
x
(
t
k
)
d
s
+
(
t
k
+
1
-
t
)
e
2
λ
t
x
(
t
)
x
(
t
k
)
T
R
1
R
2
∗
R
3
x
(
t
)
x
(
t
k
)
≤
-
e
2
λ
t
∫
t
k
t
e
-
2
λ
h
x
s
x
t
k
T
R
1
R
2
∗
R
3
x
s
x
t
k
d
s
+
(
t
k
+
1
-
t
)
e
2
λ
t
x
(
t
)
x
(
t
k
)
T
R
1
R
2
∗
R
3
x
(
t
)
x
(
t
k
)
=
-
e
2
λ
t
∫
t
k
t
e
-
2
λ
h
x
T
s
R
1
x
s
d
s
-
2
e
2
λ
t
x
T
(
t
k
)
e
-
2
λ
h
R
2
T
∫
t
k
t
x
(
s
)
d
s
-
t
k
+
1
-
t
e
2
λ
t
x
T
t
k
e
-
2
λ
h
R
3
x
t
k
+
t
k
+
1
-
t
e
2
λ
t
x
t
x
t
k
T
R
1
R
2
∗
R
3
x
t
x
t
k
≤
-
e
2
λ
t
∫
t
k
t
x
T
s
d
s
e
-
2
λ
h
h
R
1
∫
t
k
t
x
s
d
s
-
2
e
2
λ
t
x
T
t
k
e
-
2
λ
h
R
2
T
∫
t
k
t
x
s
d
s
-
t
k
+
1
-
t
e
2
λ
t
x
T
t
k
e
-
2
λ
h
R
3
x
t
k
+
t
k
+
1
-
t
e
2
λ
t
x
t
x
t
k
T
R
1
R
2
∗
R
3
x
t
x
t
k
,
V
˙
4
(
t
)
=
-
e
2
λ
t
x
(
t
)
x
(
t
k
)
∫
t
k
t
x
(
s
)
d
s
T
H
x
(
t
)
x
(
t
k
)
∫
t
k
t
x
(
s
)
d
s
+
2
λ
(
t
k
+
1
-
t
)
e
2
λ
t
x
(
t
)
x
(
t
k
)
∫
t
k
t
x
(
s
)
d
s
T
H
x
(
t
)
x
(
t
k
)
∫
t
k
t
x
(
s
)
d
s
+
2
t
k
+
1
-
t
e
2
λ
t
x
t
x
t
k
∫
t
k
t
x
s
d
s
T
H
x
˙
t
0
x
t
≤
-
e
2
λ
t
x
t
x
t
k
∫
t
k
t
x
s
d
s
T
H
x
t
x
t
k
∫
t
k
t
x
s
d
s
+
2
λ
(
t
k
+
1
-
t
)
e
2
λ
t
x
(
t
)
x
(
t
k
)
∫
t
k
t
x
(
s
)
d
s
T
H
x
(
t
)
x
(
t
k
)
∫
t
k
t
x
(
s
)
d
s
+
2
(
t
k
+
1
-
t
)
e
2
λ
t
x
T
(
t
)
X
1
+
X
1
T
2
x
˙
(
t
)
+
2
(
t
k
+
1
-
t
)
e
2
λ
t
x
T
(
t
k
)
(
-
X
1
+
X
2
)
x
˙
(
t
)
+
2
(
t
k
+
1
-
t
)
e
2
λ
t
∫
t
k
t
x
T
(
s
)
d
s
X
3
T
x
˙
(
t
)
+
2
(
t
k
+
1
-
t
)
e
2
λ
t
x
T
(
t
)
X
3
x
(
t
)
+
2
(
t
k
+
1
-
t
)
e
2
λ
t
x
T
(
t
k
)
X
4
x
(
t
)
+
2
t
k
+
1
-
t
e
2
λ
t
∫
t
k
t
x
T
s
d
s
X
5
+
X
5
T
2
x
t
.
Based on Schur complement, it can be found that for any appropriately dimensioned matrixH
i
j,  i
,
j
∈
R,(31)
∫
t
k
t
ξ
(
t
)
x
˙
(
s
)
T
H
i
j
T
e
2
λ
h
U
-
1
H
i
j
H
i
j
T
∗
e
-
2
λ
h
U
ξ
(
t
)
x
˙
(
s
)
d
s
≥
0
,where(32)
ξ
t
=
x
T
t
x
˙
T
t
x
˙
T
t
k
∫
t
k
t
x
T
s
d
s
T
.
From (31), we have (33)
-
∫
t
k
t
e
-
2
λ
h
x
˙
T
s
U
x
˙
s
d
s
≤
(
t
-
t
k
)
ξ
T
(
t
)
H
i
j
T
e
2
λ
h
U
-
1
H
i
j
ξ
(
t
)
+
2
ξ
T
t
H
i
j
T
x
t
-
2
ξ
T
t
H
i
j
T
x
t
k
.
It is noted that, for any appropriately dimensioned matricesG
1 and G
2, the following equation holds:(34)
0
=
2
e
2
λ
t
x
T
(
t
)
G
1
+
x
˙
T
(
t
)
G
2
·
-
x
˙
t
+
∑
i
=
1
N
∑
j
=
1
N
α
i
α
j
A
i
x
t
+
B
i
I
+
Λ
K
j
x
t
k
+
e
.
On the other hand, for any arbitraryγ
1
>
0,  γ
2
>
0,  γ
3
>
0, and γ
4
>
0, we can get from (8) that(35)
x
T
t
G
1
e
+
e
T
G
1
T
x
t
=
2
x
T
t
G
1
e
i
j
x
n
×
n
x
t
+
2
∑
j
=
1
N
α
j
x
T
t
G
1
e
-
i
j
x
n
×
m
I
+
Λ
K
j
x
t
k
≤
γ
1
x
T
t
G
1
G
1
T
x
t
+
γ
1
-
1
e
i
j
x
n
×
n
2
x
T
t
x
t
+
γ
2
x
T
t
G
1
G
1
T
x
t
+
∑
j
=
1
N
α
j
γ
2
-
1
e
-
i
j
x
n
×
n
2
x
T
(
t
k
)
K
j
T
I
+
Λ
T
·
(
I
+
Λ
)
K
j
x
(
t
k
)
≤
γ
1
x
T
(
t
)
G
1
G
1
T
x
(
t
)
+
γ
2
x
T
(
t
)
G
1
G
1
T
x
(
t
)
+
a
2
γ
1
-
1
x
T
(
t
)
x
(
t
)
+
b
2
γ
2
-
1
∑
j
=
1
N
α
j
x
T
t
k
K
j
T
I
+
Λ
T
I
+
Λ
K
j
x
t
k
,
x
˙
T
(
t
)
G
2
e
+
e
T
G
2
T
x
˙
(
t
)
=
2
x
˙
T
(
t
)
G
2
e
i
j
(
x
)
n
×
n
x
(
t
)
+
2
∑
j
=
1
N
α
j
x
˙
T
(
t
)
G
2
e
-
i
j
(
x
)
n
×
m
(
I
+
Λ
)
K
j
x
(
t
k
)
≤
γ
3
x
˙
T
t
G
2
G
2
T
x
˙
t
+
γ
4
x
˙
T
t
G
2
G
2
T
x
˙
t
+
a
2
γ
3
-
1
x
T
t
x
t
+
b
2
γ
4
-
1
∑
j
=
1
N
α
j
x
T
t
k
K
j
T
I
+
Λ
T
I
+
Λ
K
j
x
t
k
.
Adding the right side of (9) into V
˙
(
t
), we obtain from (30), (33), and (35) that for t
∈
t
k
,
t
k
+
1
(36)
V
˙
t
≤
e
2
λ
t
∑
i
=
1
N
∑
j
=
1
N
α
i
α
j
ξ
T
(
t
)
·
t
k
+
1
-
t
h
k
Φ
1
i
j
h
k
+
t
k
+
1
-
t
h
k
Φ
2
i
j
h
k
ξ
t
.
From (24) and (25), it is easy to get(37)
Φ
1
i
j
(
h
k
)
=
h
k
-
h
1
h
2
-
h
1
Φ
1
i
j
(
h
2
)
+
h
2
-
h
k
h
2
-
h
1
Φ
1
i
j
(
h
1
)
<
0
,
Φ
2
i
j
(
h
k
)
=
h
k
-
h
1
h
2
-
h
1
Φ
2
i
j
(
h
2
)
+
h
2
-
h
k
h
2
-
h
1
Φ
2
i
j
(
h
1
)
<
0
.
Then, we obtain from (36) and (37) that(38)
V
˙
t
<
0
,
t
∈
t
k
,
t
k
+
1
.
Thus, it follows that fort
∈
t
k
,
t
k
+
1
(39)
V
t
≤
V
t
k
≤
V
t
k
-
1
≤
⋯
≤
V
0
.
Applying Lemma5 and (39), we have for t
∈
t
k
,
t
k
+
1
(40)
x
t
2
≤
ϑ
x
t
k
2
=
ϑ
λ
min
⁡
(
P
)
e
2
λ
t
k
e
2
λ
t
k
λ
min
⁡
(
P
)
x
t
k
2
≤
ϑ
λ
min
⁡
P
e
2
λ
t
k
e
2
λ
t
k
x
T
t
k
P
x
t
k
=
ϑ
λ
min
⁡
(
P
)
e
-
2
λ
t
k
V
(
t
k
)
≤
ϑ
λ
min
⁡
P
e
-
2
λ
t
e
2
λ
t
-
t
k
V
0
≤
e
2
λ
h
2
ϑ
λ
min
⁡
P
e
-
2
λ
t
λ
max
⁡
P
x
0
2
.
From (40), we get(41)
x
(
t
)
2
≤
ϑ
x
t
k
2
≤
e
λ
h
2
ϑ
λ
max
⁡
P
λ
min
⁡
P
e
-
λ
t
x
0
.
Then, system (17) is exponentially stable. This completes the proof.Remark 7.
Theorem6 provides a stability criterion for system (1). Inspired by [19, 20], the time-dependent Lyapunov functional is adopted in the proof of Theorem 6, which can capture the characteristic of sampled-data systems and reduce the conservatism. In addition, unlike most of the existing works, the obtained results depend not only on the upper, but also on the lower bound of the variable sampling pattern, which can fully adopt the actual sampling pattern and reduce conservatism.Now, based on Theorem6, we focus on the quantized sampled-data controller design for system (17). The following theorem presents a sufficient condition of the existence of the desired controller.Theorem 8.
Consider system (1) satisfying Assumptions 1 and 4, for given scalar λ
>
0, if there exist matrices P
^
>
0, U
^
>
0, R
^
1
R
^
2
∗
R
^
3
>
0, X
^
1, X
^
2, X
^
3, X
^
4, X
^
5, G
^, and H
^
i
j
=
[
H
^
1
i
j
H
^
2
i
j
H
^
3
i
j
H
^
4
i
j
] and constants γ
1
>
0, γ
2
>
0, γ
3
>
0, γ
4
>
0, and γ
5
>
0 such that, for any i
,
j
∈
R, (42) and (43) hold:(42)
Φ
^
1
i
j
h
-
=
Ψ
1
i
j
h
-
Γ
1
i
j
Γ
1
i
j
Γ
2
i
j
Γ
2
i
j
Γ
2
i
j
∗
-
γ
1
I
0
0
0
0
∗
∗
-
γ
3
I
0
0
0
∗
∗
∗
-
γ
2
I
+
σ
2
γ
5
I
σ
2
γ
5
I
0
∗
∗
∗
∗
-
γ
4
I
+
σ
2
γ
5
I
0
∗
∗
∗
∗
∗
-
γ
5
I
<
0
,
(43)
Φ
^
2
i
j
(
h
-
)
=
Ψ
1
i
j
h
-
Γ
1
i
j
Γ
1
i
j
Γ
2
i
j
Γ
2
i
j
Γ
2
i
j
h
-
H
^
i
j
T
∗
-
γ
1
I
0
0
0
0
0
∗
∗
-
γ
3
I
0
0
0
0
∗
∗
∗
-
γ
2
I
+
σ
2
γ
5
I
σ
2
γ
5
I
0
0
∗
∗
∗
∗
-
γ
4
I
+
σ
2
γ
5
I
0
0
∗
∗
∗
∗
∗
-
γ
5
I
0
∗
∗
∗
∗
∗
∗
-
e
2
λ
h
2
U
^
<
0
,where(44)
Ψ
1
i
j
(
h
-
)
=
Ξ
^
11
i
j
+
Θ
^
11
h
-
Ξ
^
12
i
j
+
Θ
^
12
h
-
Ξ
^
13
i
j
+
Θ
^
13
h
-
Ξ
^
14
i
j
+
Θ
^
14
h
-
∗
Ξ
^
22
i
j
+
h
-
U
^
Ξ
^
23
i
j
+
Θ
^
23
h
-
h
-
X
^
3
∗
∗
Ξ
^
33
i
j
+
Θ
^
33
h
-
Ξ
^
34
i
j
+
2
λ
h
-
X
^
4
∗
∗
∗
Ξ
^
44
i
j
+
Θ
44
h
-
,
Ψ
2
i
j
(
h
-
)
=
Ξ
^
11
i
j
Ξ
^
12
i
j
Ξ
^
13
i
j
Ξ
^
14
i
j
∗
Ξ
^
22
i
j
Ξ
^
23
i
j
0
∗
∗
Ξ
^
33
i
j
Ξ
^
34
i
j
∗
∗
∗
Ξ
^
44
i
j
,
Γ
1
i
j
=
a
G
^
T
0
0
0
T
,
Γ
2
i
j
=
0
0
b
K
^
j
0
T
,
Ξ
^
11
i
j
=
2
λ
P
^
+
H
^
1
i
j
+
H
^
1
i
j
T
-
X
^
1
+
X
^
1
T
2
+
τ
1
A
^
i
G
^
T
+
τ
1
G
^
A
i
T
+
τ
1
2
γ
1
+
γ
2
I
+
γ
5
σ
2
τ
1
2
B
i
B
i
T
,
Ξ
^
12
i
j
=
P
^
+
H
^
2
i
j
+
H
^
1
i
j
T
-
τ
1
G
^
T
+
τ
2
G
^
A
i
T
+
γ
5
σ
2
τ
1
τ
2
B
i
B
i
T
,
Ξ
^
13
i
j
=
X
^
1
-
X
^
2
+
H
^
3
i
j
-
H
^
1
i
j
T
+
τ
1
B
i
K
^
j
,
Ξ
^
14
i
j
=
-
X
^
3
+
H
^
4
i
j
,
Ξ
^
22
i
j
=
-
τ
2
G
^
T
-
τ
2
G
^
+
τ
2
2
γ
3
+
γ
4
I
+
γ
5
σ
2
τ
2
2
B
i
B
i
T
,
Ξ
^
23
i
j
=
-
H
^
2
i
j
T
+
τ
2
B
i
K
^
j
,
Ξ
^
33
i
j
=
X
^
2
+
X
^
2
T
-
X
^
1
+
X
^
1
T
2
-
H
^
3
i
j
-
H
^
3
i
j
T
,
Ξ
^
34
i
j
=
-
X
^
4
-
e
-
2
λ
h
R
^
2
T
-
H
^
4
i
j
,
Ξ
^
44
i
j
=
-
X
^
5
+
X
^
5
T
2
-
e
-
2
λ
h
2
h
2
R
^
1
,
Θ
^
11
i
j
h
-
=
λ
h
-
X
^
1
+
X
^
1
T
+
h
-
R
^
1
+
h
-
X
^
3
+
h
-
X
^
3
T
,
Θ
^
12
i
j
(
h
-
)
=
h
-
X
^
1
+
X
^
1
T
2
,
Θ
^
13
i
j
h
-
=
2
λ
h
-
-
X
^
1
+
X
^
2
+
h
-
R
^
2
+
h
-
X
^
4
T
,
Θ
^
14
i
j
(
h
-
)
=
2
λ
h
-
X
^
3
+
h
-
X
^
5
+
X
^
5
T
2
,
Θ
^
23
i
j
h
-
=
h
-
-
X
^
1
+
X
^
2
,
Θ
^
33
i
j
(
h
-
)
=
2
λ
h
-
(
-
X
^
2
+
X
^
2
T
+
X
^
1
+
X
^
1
T
2
)
+
h
-
R
^
3
-
h
-
e
-
2
λ
h
2
R
^
3
,
Θ
^
44
i
j
h
-
=
λ
h
-
X
^
5
+
X
^
5
T
.
Then, system (1) is exponentially stable, and the quantized sampled-data controller in (16) is given by(45)
K
j
=
K
^
j
G
^
-
T
.Proof.
Define(46)
G
1
=
τ
1
G
,
G
2
=
τ
2
G
,
G
^
=
G
-
1
,
K
^
j
=
K
j
G
^
T
,
P
^
=
G
^
P
G
^
T
,
U
^
=
G
^
U
G
^
T
,
R
^
1
=
G
^
R
1
G
^
T
,
R
^
2
=
G
^
R
2
G
^
T
,
R
^
3
=
G
^
R
3
G
^
T
,
X
^
1
=
G
^
X
1
G
^
T
,
X
^
2
=
G
^
X
2
G
^
T
,
X
^
3
=
G
^
X
3
G
^
T
,
X
^
4
=
G
^
X
4
G
^
T
,
H
^
1
i
j
=
G
^
H
1
i
j
G
^
T
,
H
^
2
i
j
=
G
^
H
2
i
j
G
^
T
,
H
^
3
i
j
=
G
^
H
3
i
j
G
^
T
,
H
^
4
i
j
=
G
^
H
4
i
j
G
^
T
.
Before and after multiplying (24) by diag
G
^
,
G
^
,
G
^
,
G
^ and diag
G
^
T
,
G
^
T
,
G
^
T
,
G
^
T, we get (47)
Ψ
-
1
i
j
(
h
-
)
+
a
2
γ
1
-
1
Γ
1
i
j
Γ
1
i
j
T
+
a
2
γ
3
-
1
Γ
1
i
j
Γ
1
i
j
T
+
b
2
γ
2
-
1
Γ
2
i
j
I
+
Λ
T
(
I
+
Λ
)
Γ
2
i
j
T
+
b
2
γ
4
-
1
Γ
2
i
j
I
+
Λ
T
(
I
+
Λ
)
Γ
2
i
j
T
<
0
,where(48)
Ψ
-
1
i
j
h
-
=
Ξ
^
11
i
j
+
Θ
^
11
h
-
-
γ
5
σ
2
τ
1
2
B
i
B
i
T
Ξ
^
12
i
j
+
Θ
^
12
h
-
-
γ
5
σ
2
τ
1
τ
2
B
i
B
i
T
Ξ
^
13
i
j
+
Θ
^
13
h
-
+
τ
1
B
i
Λ
K
^
j
Ξ
^
14
i
j
+
Θ
^
14
h
-
∗
Ξ
^
22
i
j
+
h
-
U
^
-
γ
5
σ
2
τ
1
τ
2
B
i
B
i
T
Ξ
^
23
i
j
+
Θ
^
23
h
-
+
τ
2
B
i
Λ
K
^
j
h
-
X
^
3
∗
∗
Ξ
^
33
i
j
+
Θ
^
33
h
-
Ξ
^
34
i
j
+
2
λ
h
-
X
^
4
∗
∗
∗
Ξ
^
44
i
j
+
Θ
44
h
-
.
Using Schur complement, we obtain(49)
Φ
~
1
i
j
(
h
-
)
+
Γ
3
i
j
Λ
T
Γ
4
i
j
T
+
Γ
4
i
j
Λ
Γ
3
i
j
T
<
0
,where(50)
Φ
~
1
i
j
(
h
-
)
=
Ψ
~
1
i
j
h
-
Γ
1
i
j
Γ
1
i
j
Γ
2
i
j
Γ
2
i
j
∗
-
γ
1
I
0
0
0
∗
∗
-
γ
3
I
0
0
∗
∗
∗
-
γ
2
I
0
∗
∗
∗
∗
-
γ
4
I
,
Ψ
~
1
i
j
h
-
=
Ξ
^
11
i
j
+
Θ
^
11
h
-
-
γ
5
σ
2
τ
1
2
B
i
B
i
T
Ξ
^
12
i
j
+
Θ
^
12
h
-
-
γ
5
σ
2
τ
1
τ
2
B
i
B
i
T
Ξ
^
13
i
j
+
Θ
^
13
h
-
Ξ
^
14
i
j
+
Θ
^
14
h
-
∗
Ξ
^
22
i
j
+
h
-
U
^
-
γ
5
σ
2
τ
1
τ
2
B
i
B
i
T
Ξ
^
23
i
j
+
Θ
^
23
h
-
h
-
X
^
3
∗
∗
Ξ
^
33
i
j
+
Θ
^
33
h
-
Ξ
^
34
i
j
+
2
λ
h
-
X
^
4
∗
∗
∗
Ξ
^
44
i
j
+
Θ
44
h
-
,
Γ
3
i
j
=
Γ
2
i
j
T
0
0
0
0
T
,
Γ
4
i
j
=
τ
1
B
i
T
τ
2
B
i
T
0
0
0
0
I
I
T
.
From lemma, for anyγ
5
>
0,(51)
Φ
~
1
i
j
(
h
-
)
+
γ
5
-
1
Γ
3
i
j
Γ
3
i
j
T
+
σ
2
γ
5
Γ
4
i
j
Γ
4
i
j
T
<
0
.
Using Schur complement again, we get (42). Before and after multiplying (25) by diag
G
^
,
G
^
,
G
^
,
G
^
,
G
^ and diag
G
^
T
,
G
^
T
,
G
^
T
,
G
^
T
,
G
^
T, by using the above similar method, we can also get (43). This completes the proof.Remark 9.
Theorem8 provides a design method of the sampled-data controller with quantization for nonlinear systems. The conditions in Theorem 8 are formulated in LMIs and thus can be effectively solved by using LMI toolbox in MATLAB.


## 4. Examples

Consider the following nonlinear mass-spring system [42]:(52)
x
˙
1
t
=
x
2
t
,
x
˙
2
t
=
-
0.01
x
1
t
-
0.67
x
1
3
t
+
u
t
,where x
1
∈
-
1,1,  x
2
∈
-
0.8,0.8.The system matrices of the system in (1) are(53)
F
x
=
0
1
-
0.01
-
0.67
x
1
2
0
,
G
x
=
0
1
.Choose the open covering asU
1
=
(
-
1.1,1.1
)
×
(
-
0.9,0.2
) and  U
2
=
(
-
1.1,1.1
)
×
(
0.1,0.9
). The corresponding sample data are chosen as (
0.5
,
-
0.5
) and (
-
0.3,0.6
), respectively.Calculating the coefficient matrices in (17), we have(54)
A
1
=
0
1
-
0.1775
0
,
A
2
=
0
1
-
0.2512
0
,
B
1
=
B
2
=
0
1
.The modeling errors are computed as follows:(55)
e
i
j
x
n
×
n
=
F
x
-
∑
k
=
1
N
α
k
x
A
k
≤
max
⁡
1
≤
k
≤
2
F
k
x
-
A
k
=
0.6432
,
e
-
i
j
(
x
)
n
×
n
=
G
(
x
)
-
∑
k
=
1
N
α
k
(
x
)
B
k
=
0
,where F
k
(
x
) denotes F
(
x
) on U
k.In this example, we choose the initial conditionx
(
0
)
=
1
0.5
T, the minimum sampling period h
1
=
0.01, the maximum sampling period h
2
=
0.03, and the convergence rate λ
=
0.2. In addition, the parameter for the quantizer is assumed to be ρ
=
0.9. By solving the LMIs in Theorem 8, we can get the controller gains from (45) that(56)
K
1
=
-
1.3047
-
4.0082
,
K
2
=
-
0.5914
-
4.9775
.The model in (52) has been studied by T-S fuzzy systems (T-S) method in [42]. To illustrate the effectiveness of partition of unity (PoU) method, the comparison of simulation results is shown in Figure 1. It can be shown from Figure 1 that the method used in our paper gives faster convergence rate. The reason is that the fuzzy method ignores the modeling error, while partition of unity method yields an equivalent model with modeling error, better representing the characteristics of the origin nonlinear system. Therefore, the results will hold if the modeling error exists by using fuzzy control method.Figure 1
State response using T-S fuzzy and partition of unity methods, respectively.


## 5. Conclusion

In this paper, the problem of quantized sampled-data control for a class of nonlinear systems has been investigated. Based on partition of unity method, the system has been converted into a linear-like system with modeling error. By introducing a Lyapunov functional, sufficient conditions for the existence of desired controller have been derived. An example has been presented to show the effectiveness and benefits of proposed method.



---

*Source: 314090-2015-04-19.xml*