Position Control of A PM Stepper Motor Using Neural Networks
Position Control of A PM Stepper Motor Using Neural Networks
Position Control of A PM Stepper Motor Using Neural Networks
Introduction
Problem formulation
A=
B=
0 0 0 0
1 0
0 0 0 0
0 1
0 x 2 x 2 d r (t )
a 30 a 31 a 32
+
(3)
u =
0
0 a 40 x3 x3d 0
0
x4
where [ x1d x 2 d x 3d ] := [ d d d ] / K 3 , d , d , d are
the desired position, speed and acceleration profiles
respectively, and r (t ) = d / K 3 . It can be seen that with
the above controller, the closed loop system can be
expressed as,
~
x = Ac ~
x
(4)
where
~
x := [x x
x x
x x
x ]T
0
0
Ac =
a 30
1d
2d
0
a 31
1
a 32
3d
[ x1 x 2 x3 ] := [ ] / K 3 ,
:= , K 3 := K m / J ,
0
0
.
0
a 40
a31 a32
0
x1 x1d
0 x2 x2 d r (t )
+
a40 x3 x3d 0
x4
(7)
(8)
u c = f (x)
would lead to the closed loop system expressed as in
eqn.(4), i.e., the known modeling uncertainties could be
well compensated.
Unfortunately, the non-linear function f(x) is unknown a
priori in practice. Therefore the above modified controller
could not be implemented. However, this controller
suggests indeed that a well estimated function f ( x) of the
non-linear function f(x) could be used to improve the
stepper motor positioning performance. It is noted that
there exist another nonlinear function h(x~ ) such that
f ( x ) = h( ~
x ) by taking notice of the definition of the state
variable ~
x . With the same control law (6), (7) and a new
compensating control law, which will be discussed
subsequently, the closed loop stepper motor control system
can be expressed as,
~
(9)
x = Ac ~
x + B[u c + h( ~
x )]
Due to their great approximation capability, artificial
neural networks will be used in this paper to identify this
non-linear function [8-10]. For this we make the following
assumptions.
Assumption 1: The closed loop stepper motor control
system, whose controller is designed based on the nominal
stepper motor model, is stable, and the tracking error
vector ~
x belongs to a compact set.
Assumption 2:
(i) Given a positive constant
0 and a continuous
function h : C R , where C R mr is a
compact set, there exists a weight vector = *
such that the output h( ~
x , ) of the neural
network architecture with n* nodes satisfies
x , * ) h( ~
x ) | ,
max | h( ~
~
xC
(17)
(18)
with Q 0.
(11)
T
h( ~
x , * ) = * ( ~
x)
(13)
where * is a matrix representing the optimal weight
values subject to the constraints ||*|| M, the vector field
*
x ) R n which is refereed to regressor, is Gaussian type
(~
~
xC
2
=
~
~
1 ~T
1
x ] + [ T ( ~
x ) + ]T BT P~
x + tr (T )
[ x ( PAc + AcT P) ~
~
~
1 ~T ~
1
[ x Qx ] ( ~
x ) T B T P~
x + T B T P~
x + tr ( T )
2
(19)
Noting that
~
~
(~
x ) T B T P~
x = tr ( B T P~
x (~
x )T )
if we choose the parameter update law as
~
x PB T ( ~
x)
= ( ~
,
x )~
x T PB c0
M 2
1 if || T || = M and ~
x T PB T > 0
c0 =
0
otherwise
2 2 max ( P)
.
min (Q )
This implies that the positioning error will also belong to
the residue.
to a residue of radius R0 = 0 with :=
(20)
4.
(21)
2
~
1 T ~ 1
= ~
x Qx + tr[ ( ~
x )~
x T PB + ) T ] + T B T P~
x
2
~
1 T ~
x T PB T ~ T
(22)
)
= ~
x Qx + T B T P~
x c 0 tr (
2
M 2
Now let's have a look at the last term in the above
equation,
~
x T PB T ~ T
)
c 0 tr (
M 2
~
~
x T PB T
= c0
tr ( T )
2
M
~
x T PB T
= c0
tr ( T *T )
2
M
0
Actually, it is noted that when || || < M or || || = M and
~
x T PB T 0 , then c0 = 0, the above inequality is trivial;
when || || = M and ~
x T PB T > 0 , then, due to the fact
that ||*|| M, we can have ( T *T ) 0 , therefore,
the above inequality is also true. In other words, the
projection will not make the derivative of the Lyapunov
type function more positive. Therefore we have
1 T ~
V ~
x Qx + T B T P~
x
2
1
min (Q) || ~
x || 2 + 0 max ( P) || B || || ~
x ||
2
(23)
1
= || ~
x || [ min (Q ) || ~
x || 2 2 0 max ( P)]
2
where max(P) and mix(Q) denote the maximum
eigenvalue of matrix P and the minimum eigenvalue of
matrix Q respectively.
Consequently, it can be concluded from the eqn.(23) that
the system is convergent and tracking error ~
x will belong
Conclusions