Professional Documents
Culture Documents
_
w
lj
((t)), j = 1, 2, . . . , k, l = 1, 2, . . . , p
w
l1
((t)) = 1
k
j=2
w
lj
((t))
w
lj
((t)) = w
lj
(
j
(t))
(3)
where k is the number of sectors, and
(t) =
_
1
(t)
2
(t)
q
(t)
(4)
is the vector of premise variables. It is supposed that a
premise variable represents any measurable variable, and
can be a function of state variables or, in a simple case,
it can be chosen as a state variable. It is supposed that
the premise variables are not functions of the input vector
u(t) to avoid a complicated defuzzication process.
Using a TS model, the conclusion part of a single rule
consists no longer of a fuzzy set [11], but determines
a function with state variables as arguments, and the
corresponding function is a local function for the fuzzy
region that is described by the premise part of the rule.
Thus, using linear functions, a system state is described
locally (in fuzzy regions) by linear models, and at the
boundaries between regions an interpolation is used be-
tween the corresponding local models.
Given a pair of (q(t), u(t)) the nal states of the
systems are inferred as follows
q(t) =
k
h=1
k
j=1
w
1h
(
i
(t)) w
pj
(
j
(t))
i...j
k
h=1
k
j=1
w
1h
(
i
(t)) w
pj
(
j
(t))
(5)
h...j
= A
h...j
q(t) +Bu(t) (6)
where
h...j
is the linear model associated with the
(h. . . j) combination of sector function indexes. It is
evident that a general fuzzy model is achieved by fuzzy
amalgamation of the linear systems models.
Thus, the set {w
i
((t)), i = 1, 2, . . . s, s = 2
k
} can
be constructed from all combinations of sector functions,
e.g. ordered as follows
w
1
((t)) = w
11
(
1
(t)) w
p1
(
1
(t))
.
.
.
w
s
((t)) = w
1k
(
k
(t)) w
pk
(
k
(t))
(7)
which implies
q(t) =
s
i=1
w
i
((t))
i
(t)
s
i=1
w
i
((t))
=
s
i=1
h
i
((t))
i
(t) (8)
i
= A
i
q(t) +Bu(t) (9)
where
h
i
((t)) =
w
i
((t))
s
i=1
w
i
((t))
(10)
is the averaging weight for the i-th rule, representing the
normalized grade of membership (membership function).
By denition, the membership functions satisfy the fol-
lowing convex sum properties
0 h
i
((t)) 1,
s
i=1
h
i
((t)) = 1 i {1, . . . , s} (11)
and the linear consequent equation represented by (9) is
called a linear subsystem.
Assuming, the vector function a(q(t)) is bounded in
sectors, i.e. in the fuzzy regions within the system will
operate, and takes the value a(0) = 0, the fuzzy approx-
imation of (1) leads to (8), (9) where A
i
IR
nn
is the
Jacobian matrix of a(q(t)) with respect to q(t) = q
i
, and
q
i
is the center of the i-th fuzzy region described by the
associated sector function from the set (3).
Assumption 1: The matrices B, C are the same for all
local models.
Assumption 2: The pair (a(q(t)), B) is locally control-
lable and B (C) is of full column (row) rank, where
a(q(t)) =
s
i=1
h
i
((t))A
i
(12)
Thus, the the entire TS fuzzy model of (1), (2) is
reached by fuzzy blending of all consequents linear
sub-models through the set of normalized membership
functions {h
i
((t)), i = 1, 2, . . . , s}, i.e.
q(t) =
s
i=1
h
i
((t))(A
i
q(t) +Bu(t)) (13)
y(t) = Cq(t) (14)
Note, the aforementioned model does not include param-
eter uncertainties or external disturbances. It is supposed
in the next that r = m.
III. ENHANCED FUZZY STATIC OUTPUT CONTROL
DESIGN
In the next, the fuzzy static output controller is designed
using the concept of parallel distributed compensation,
in which the fuzzy controller shares the same sets of
normalized membership functions like the T-S fuzzy
system model.
Denition 1: Considering (13), (14), and using the
same set of membership function (11), the fuzzy static
output controller is dened as
u(t) =
=
s
j=1
h
j
((t))K
j
y(t)=
s
j=1
h
j
((t))K
j
Cq(t)
(15)
Note that the fuzzy controller (15) is in general nonlinear.
Theorem 1: The equilibrium of the fuzzy system (13),
(14) controlled by the fuzzy controller (15) is globally
quadratically stable if there exist positive denite sym-
metric matrices U, V IR
nn
, a positive denite matrix
T IR
nn
, and matrices N
j
IR
rn
such that
T > 0, U = U
T
> 0, V = V
T
> 0 (16)
_
A
i
V +VA
T
i
+BN
j
C+C
T
N
T
j
B
T
Y
ij
T U+A
i
V +BN
j
C 2U
_
<0
(17)
_
_
Y
11
Y
12
Y
1s
Y
12
Y
22
Y
2s
.
.
.
.
.
.
.
.
.
.
.
.
Y
1s
Y
2s
Y
ss
_
_
> 0 (18)
for h
i
((t))h
j
((t)) = 0, i, j = 1, 2, . . . , s.
The set of control law gain matrices is given as follows
K
j
= N
j
M
1
, j = 1, 2, . . . , s (19)
where
M = CV C
1
(20)
C
1
= C
T
(CC
T
)
1
(21)
and C
1
is Moore-Penrose pseudo-inverse of C.
Hereafter, denotes the symmetric item in a symmetric
matrix.
Proof: Considering the model (13), (14) and the control
law (15) then it yields
q(t) =
s
i=1
s
j=1
h
i
((t))h
j
((t))(A
i
BK
j
C)q(t) (22)
Writing (22) in the form
q(t)
s
i=1
s
j=1
h
i
((t))h
j
((t))(A
i
BK
j
C)q(t)=0 (23)
then with arbitrary symmetric regular matrices S
1
, S
2
IR
nn
it yields
_
q
T
(t)S
1
+
+ q
T
(t)S
2
_
_
_
q(t)
i=1
s
j=1
h
i
h
j
(A
i
BK
j
C)q(t)
_
_
=0 (24)
where for simplicity the arguments of membership func-
tions are omitted.
Dening the quadratic positive Lyapunov function
v(q(t)) = q
T
(t)Pq(t) > 0 (25)
where P IR
nn
is a positive denite symmetric matrix,
then it is
v(q(t)) = q
T
(t)Pq(t) +q
T
(t)P q(t) < 0 (26)
Thus, adding (24) as well as the transposition of (24) to
(26), it yields
v(q(t)) = q
T
(t)Pq(t) +q
T
(t)P q(t)+
+
_
_
q
T
(t)
q
T
(t)
s
i=1
s
j=1
h
i
h
j
(A
i
BK
j
C)
T
_
_
_
S
1
q(t)+
+S
2
q(t)
_
+
+
_
q
T
(t)S
1
+
+ q
T
(t)S
2
_
_
_
q(t)
i=1
s
j=1
h
i
h
j
(A
i
BK
j
C)q(t)
_
_
<0
(27)
Adding to (27), as well as subtracting from (27) the next
term
v
v
((t)) = q
T
(t)Z((t))q(t) (28)
where
Z((t)) =
s
i=1
s
j=1
h
i
((t))h
j
((t))X
ij
> 0 (29)
and {X
ij
= X
T
ij
IR
nn
, i, j = 1, 2, . . . , s} is the set
of symmetric matrices, then it is obtained
v(q(t)) = q
T
(t)Pq(t) +q
T
(t)P q(t)+
+
_
_
q
T
(t)
q
T
(t)
s
i=1
s
j=1
h
i
h
j
(A
i
BK
j
C)
T
_
_
_
S
1
q(t)+
+S
2
q(t)
_
+
+
_
q
T
(t)S
1
+
+ q
T
(t)S
2
_
_
_
q(t)
i=1
s
j=1
h
i
h
j
(A
i
BK
j
C)q(t)
_
_
q
T
(t)
s
i=1
s
j=1
h
i
h
j
X
ij
q(t) <q
T
(t)Z((t))q(t) < 0
(30)
Using the notation
q
T
(t) =
_
q
T
(t) q
T
(t)
(31)
the inequality (30) can be compactly rewritten as
v(q(t))=
s
i=1
s
j=1
h
i
((t))h
j
((t))q
T
(t)P
ij
q
(t)<
< q
T
(t)Z((t))q(t) < 0
(32)
where
P
ij
=
=
_
S
1
(A
i
BK
j
C)(A
i
BK
j
C)
T
S
1
X
ij
P+S
1
S
2
(A
i
BK
j
C) 2S
2
_
(33)
It is evident, P
ij
must be negative denite and Z((t))
has to be positive denite since (32) has to be negative.
Since r = m, it is possible to set
BK
j
C = BK
j
MM
1
C = BN
j
CS
1
(34)
where
K
j
M = N
j
, M
1
C = CS
1
(35)
and M IR
mm
is a regular square matrix. Inserting
(35) into (33) results in
P
ij
=
_
ij
P+S
1
S
2
(A
i
BN
j
CS
1
) 2S
2
_
(36)
where
ij
=X
ij
S
1
(A
i
BN
j
CS
1
)(A
i
BN
j
CS
1
)
T
S
1
(37)
Dening the congruence transform matrix as follows
T =
_
S
1
1
S
1
2
(38)
and pre-multiplying left-hand and right-hand side of (36)
by T gives
_
ij
S
1
2
PS
1
1
+S
1
2
(A
i
S
1
1
BN
j
C) 2S
1
2
_
<0
(39)
where
ij
= S
1
1
ij
S
1
1
= S
1
1
X
ij
S
1
1
(A
i
S
1
1
BN
j
C)(A
i
S
1
1
BN
j
C)
T
(40)
and using the notations
T =S
1
2
PS
1
1
, V =S
1
1
, U=S
1
2
, Y
ij
=VX
ij
V
(41)
then (39) implies (17).
Since (30) is conditioned by (29), then with respect to
(41) it so also yields
Z
v
((t)) = V Z((t))V =
=
s
i=1
s
j=1
h
i
((t))h
j
((t))Y
ij
> 0
(42)
where {Y
ij
= Y
T
ij
IR
nn
, i, j = 1, 2, . . . , s} is the set
of symmetric matrices.
Writing Z
v
((t)) as follows
0 < Z
v
((t)) =
=
_
_
h
1
((t)
h
2
((t)
.
.
.
h
s
((t)
_
_
T
_
_
Y
11
Y
12
Y
1s
Y
12
Y
22
Y
2s
.
.
.
.
.
.
.
.
.
.
.
.
Y
1s
Y
2s
Y
ss
_
_
_
_
h
1
((t)
h
2
((t)
.
.
.
h
s
((t)
_
_
(43)
then (43) implies (18).
Moreover, (35) gives
MC = CS
1
1
= CV (44)
then pre-multiplying the right side of (44) by C
T
gives
CV C
T
= MCC
T
(45)
and
M = CV C
T
(CC
T
)
1
= CV C
1
(46)
Evidently, (35), (46) imply (19)(21), respectively. This
concludes the proof.
This principle naturally extends the afne TS model
principle, and by introducing the slack matrix variables
U, V into the LMIs the system matrices are decoupled
from the equivalent Lyapunov matrix T. Note, the above
presented inequalities are linear matrix inequalities, the
equivalent Lyapunov matrix T is positive denite, but not
symmetric.
Theorem 2: The equilibrium of the fuzzy system (13),
(14) controlled by the fuzzy controller (15) is globally
quadratically stable if there exist positive denite sym-
metric matrices T, V IR
nn
, a positive scalar IR
and matrices N
j
IR
rn
such that
T = T
T
> 0, V = V
T
> 0, > 0 (47)
_
A
i
V +VA
T
i
+BN
j
C+C
T
N
T
j
B
T
Y
ij
T V +A
i
V +BN
j
C 2V
_
<0
(48)
_
_
Y
11
Y
12
Y
1s
Y
12
Y
22
Y
2s
.
.
.
.
.
.
.
.
.
.
.
.
Y
1s
Y
2s
Y
ss
_
_
> 0 (49)
for h
i
((t))h
j
((t)) = 0, i, j = 1, 2, . . . , s.
The set of control law gain matrices is given by (19)
(21).
Proof: Now, instead of the notations (41), there are
used in (39) the next substitutions
V = S
1
1
, V = S
1
2
, > 0 (50)
T =S
1
2
PS
1
1
= V PV , Y
ij
=VX
ij
V (51)
respectively. It is evident that with (50), (51) then (39)
implies (48), where T is a symmetric positive denite
matrix. This concludes the proof.
Note, (48) are LMIs only if is a prescribed constant
which can be considered as a tuning parameter. Con-
sidering as a LMI variable, (48) are bilinear matrix
inequalities (BMI).
IV. ILLUSTRATIVE EXAMPLE
The nonlinear dynamics of the hydrostatic transmission
was taken from [4] and this model was used in control
design and simulation.
The hydrostatic transmission dynamics is represented
by a nonlinear fourth order state-space model
q
1
(t)= a
11
q
1
(t) + b
11
u
1
(t)
q
2
(t)= a
22
q
2
(t) + b
22
u
2
(t)
q
3
(t)= a
31
q
1
(t)p(t) a
33
q
3
(t) a
34
q
2
(t)q
4
(t)
q
4
(t)= a
43
q
2
(t)q
3
(t) a
44
q
4
(t)
where q
1
(t) is the normalized hydraulic pump angle,
q
2
(t) is the normalized hydraulic motor angle, q
3
(t) is
the pressure difference [bar], q
4
(t) is the hydraulic motor
speed [rad/s], p(t) is the speed of hydraulic pump [rad/s],
u
1
(t) is the normalized control signal of the hydraulic
pump, and u
2
(t) is the normalized control signal of
the hydraulic motor. It is supposed that the external
variable p(t), as well as the second state variable q
2
(t)
are measurable. In given working point the parameters are
a
11
= 7.6923 a
22
= 4.5455 a
33
= 7.6054.10
4
a
31
= 0.7877 a
34
= 0.9235 b
11
= 1.8590.10
3
a
43
= 12.1967 a
44
= 0.4143 b
22
= 1.2879.10
3
Since the variables p(t) 105, 300 and q
2
(t)
0.0001, 1 are bounded on the prescribed sectors then
vector of the premise variables can be chosen as follows
(t) =
_
1
(t)
2
(t)
=
_
q
2
(t) p(t)
_
a
11
0 0 0
0 a
22
0 0
a
31
c
k
0 a
31
a
34
b
l
0 0 a
43
b
l
a
44
_
_
B =
_
_
a
11
0
0 b
22
0 0
0 0
_
_
, C
T
=
_
_
0 0
1 0
0 1
0 0
_
_
with the associations
i = 1 (l = 1, k = 1) i = 2 (l = 2, k = 1)
i = 3 (l = 1, k = 2) i = 4 (l = 2, k = 2)
Thus, solving (47), (48) with respect to the LMI matrix
variables T, V , N
j
, j = 1, 2, 3, 4, and with = 10
and Y
ij
= 0 i, j = 1, 2, 3, 4 then, using SelfDual
Minimization (SeDuMi) package for Matlab [13], the
feedback gain matrix design problem was feasible with
the results
T =
_
_
0.0082 0.0000 0.1065 0.0021
0.0000 3.9527 0.0001 0.0001
0.1065 0.0001 2.4732 0.6421
0.0021 0.0001 0.6421 7.7690
_
_
V =
_
_
0.0006 0.0000 0.0071 0.0004
0.0000 0.2073 0.0000 0.0000
0.0071 0.0000 0.1645 0.1036
0.0004 0.0000 0.1036 0.8043
_
_
K
1
=
_
0.00000001 0.00021460
0.00381356 0.00000017
_
K
2
=
_
0.00000001 0.00021460
0.00382179 0.00000008
_
0 0.5 1 1.5 2 2.5 3
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
time [s]
y
(
t
)
y
1
(t)
y
2
(t)
Fig. 1. System output response
K
3
=
_
0.00000001 0.00021460
0.00382358 0.00000002
_
K
4
=
_
0.00000001 0.00021460
0.00382023 0.00000023
_
which rise up a stable set of closed-loop subsystems. It
can be seen that with an enough precision the used design
conditions imply the approximately equal control gain
matrices.
The conditions in simulations were specied for the
system in the forced regime, where
u(t) =
s
j=1
h
j
((t))(K
j
Cq(t) +Ww(t))
w
T
(t) =
_
0.5 0.3