Академический Документы
Профессиональный Документы
Культура Документы
In this Section we present a method of a dead- equation (8) takes the form
beat control strategy evaluation (Ogata, 1987), ~ ~
~e = ~
rk - A k x 0 - M k v k
(Ostalczyk, 2003). Here, a well-known least- k (11)
squares method is applied (Ifeachor and Jervis,
1993). Let us dene a 3 (k + 1) 1 closed-loop Now the task is to evaluate vk;opt such that the
system errors vector and a 3 1demand signal following performance index is minimal
vector I (vk;opt ) = min eTk ek (12)
2 3 v
e0 2 3
6 e1 7 d10 It should be noted that this ensures minimal
6 7
e = 6 . 7 d = 4 d20 5
~ (5) values of a sum
4 .. 5 d30 k
X k
X k
X
ek
I (vk;opt ) = x21i + x22i + x23i (13)
e0 = d i=0 i=0 i=0
(6)
ei = d xi for i = 1; ;k
i.e. minimal squares sum of all elements of a state-
From the state-space equation describing the vector. Evaluating I (vk )we obtain
I (v k ) =
plant (Rybicki and Ostalczyk, 2006), for consecu-
tive time instants k = 0; 1; we obtain
x1 = Ax 0 + bv0 ( ~ ~ T ~
)(~
= ~rk - A k x 0 - M k v k ~rk - A k x 0 - M k v k ) (14)
x 2 = A 2 x 0 + Ab v0 + bv1 The minimum value is obtained for
( ) M~ (~r - A~ x )
M -1
~ ~
k k -1 v k ,opt = M Tk M k T
xk = A x0 + A bv0 + L + Ab vk -1 + bvk k k k 0
(15)
(7)
e 0 r 0
e 2.1 Simulation of an electromagnetic servo dead-beat
1 = r - A x - control
M M M 0
k
e k r A (8) Assuming a linear feed of a core on a level and
zero initial conditions , the control strategy for a
0 0 L 00 mathematical model is presented in Fig 1.
b v0
0 L 0 0
v1
M
40
- M M M
k -2
A b A b
k -3 M
L b 0
30 nk
vk
A k -1b A k -2 b L Ab b
20
10
yk
0
-10
Denoting further
-20
r 0 v0 k
r A -30
rk = , A k = , v k = 1
M M M
k
r A v k (9) Fig.1. The position of a core of a rst model
(continuous line) with zero initial conditions and
a control without constrains (dashed line) vs. time
One can realise that the evaluated control strat- x0
egy exceeds admissible values j k j 6 max , where
max = 10 [V ]. This forces a modication of a con-
trol strategy. For some non-zero initial conditions, Evaluation of Evaluation of
for instance x k +1
v k,opt
2 3
102 1
x (0) = 4 0 5
7
20 10 Condition M No
Yes
it is possible to obtain a control strategy included
in the prescribed control interval. This is pre-
sented in Fig. 2 v k,o p t
yk
2.3 Simulation of an electromagnetic servo dead-beat
control with constraints
nk
On the controlling signal for i = 0; 1; 2; one 10
where kp is a constant term. A sensor can be According to the equation given above the closed-
described by a proportional element kh Equation loop system control may be represented by a block
(21) can be rearranged into the form diagram in Fig.5.
2 3 (nk )
0 D k vk
x0
k
6 7 1
(nk ) (nk ) (nk ) 6 k 1 7
b b b 6 .. 7= ek
4 5 kp
0 1 k . nk
0
(22)
dk vk yk
It is valid for all k = 0; 1; 2; . Collecting all
(nk )
0 D k vk
equations (dened for all k) in a one vector-matrix
equation we obtain
Plant
ek
b (nk ) b (nk ) L b (nk ) v ek Sensor
0 (
1
nk -1 ) (
k k
nk -1 ) v
0 b0 L bk -1 k -1 1 ek -1
=
M M M M k p M Fig.5. Block diagram of a closed-loop system with
(n )
0 L b0 0 v0
an electromechanical servo and a VOFO controller
0 e0
(23)
3.1 Non-uniqueness of a dead-beat variable fractional-order
From a block diagram of a closed-loop system one control strategy
derives
As was mentioned above a FO evaluation proce-
ek d k yk dure is a polynomial roots calculation. One should
e d
k -1 = k -1 - k y k -1 take into account only real roots. This means that
h M
M M in every consecutive step an additional solution
may be added. This causes a non-uniqueness of
e0 d 0 y0 (24) the proposed control strategy. In a considered
system the values presented by points in Fig. 6
Taking into account equation (15) we get were obtained
2 (n ) (n ) (n )
3
b0 k b1 k bk k
6 (n
6 0 b0 k 1
) (n )7
bk k1 1 7 nk ,i
6 . .. .. 7
6 . 7
4 . . . 5
(n0 )
0 0 b0
(
~ ~ -1 ~
) (
M Tk M k M Tk ~
~
rk - A k x 0 =
)
dk yk k
y
1 d k -1
= - k h k -1
kp M M
d Fig.6. Equation (23) solutions, as functions of k
0 y 0 (25) Hence one can build a control sequence. Here
there is a great choice of orders. One can for
In a k-th sampling interval one solves a k-th order instance easily check that the optimal control se-
polynomial in a variable nk quence with constrains (17) is realised for VOFO
sequence. Here there were assumed that for k = microprocessor memory may be lled. To avoid
1; 2; ; l where l k this problem we realise that for su ciently high
values of k, say k > m i ; ei = 0. Hence from
nk = min jnk;j j (27)
nk;j equation (25) we immediately get