Download Full Issue in PDF - Academy Publisher
Download Full Issue in PDF - Academy Publisher
Download Full Issue in PDF - Academy Publisher
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
JOURNAL OF COMPUTERS, VOL. 8, NO. 6, JUNE 2013 1493<br />
Suppos<strong>in</strong>g<br />
select<strong>in</strong>g μ =<br />
1<br />
T<br />
2<br />
2 −ρt<br />
ε = + 2 bP ψ0e + 2ψ1K c<br />
Ξ , and<br />
4ε<br />
2<br />
2<br />
1⎛<br />
1 ⎞<br />
⎜σ 3<br />
− σ4Lξ<br />
ε1⎟<br />
2⎝<br />
2 ⎠<br />
, then<br />
( σε<br />
4 2( Lb<br />
ξ d<br />
+ Lq)<br />
)<br />
1<br />
2<br />
V<br />
⎛<br />
⎞<br />
( e, η) ≤−⎜λm<strong>in</strong> ( Q) −0.5− μσ4Lξ<br />
⎟ e + <br />
⎝<br />
2 ε1<br />
⎠<br />
Adjust<strong>in</strong>g Q to make<br />
⎛ 1 ⎞<br />
3 4 1<br />
1<br />
⎜σ − σ Lξ<br />
ε ⎟<br />
2<br />
2<br />
−<br />
⎝<br />
⎠<br />
η + ε<br />
2<br />
4<br />
( σε<br />
4 2( Lb<br />
ξ d<br />
+ Lq)<br />
)<br />
1<br />
λ ( ) −0.5− μσ > 0.<br />
m<strong>in</strong><br />
Q<br />
4L ξ<br />
2ε1<br />
2<br />
2<br />
(43)<br />
From the above equation, we can know that track<strong>in</strong>g<br />
error and <strong>in</strong>ternal states η are all uniformly ultimately<br />
bounded.<br />
Besides,<br />
s<strong>in</strong>ce ξ ≤ e + y y y ≤ e + b , then<br />
(1) ( r−1)<br />
T<br />
(<br />
d d<br />
<br />
d<br />
)<br />
d<br />
the state ξ is uniformly ultimately bounded too. This<br />
completes the proof.<br />
VI. SIMULATION RESULTS<br />
In this part, the follow<strong>in</strong>g SISO nonaff<strong>in</strong>e nonl<strong>in</strong>ear<br />
system with zero dynamics is simulated to illustrate the<br />
effectiveness of the proposed adaptive neural network<br />
track<strong>in</strong>g controller. The nonaff<strong>in</strong>e nonl<strong>in</strong>ear system is<br />
described as follows:<br />
ξ = ξ<br />
1 2<br />
2<br />
(( ) )( )<br />
ξ =−2 ξ −η −1 ξ −η −η − 0.2η<br />
+ <br />
2 1 1 2 2 1 2<br />
⎡ 1 3 ⎤<br />
+ ( 2 + s<strong>in</strong> ([ ξ1−η1][ ξ2 − η2]<br />
))<br />
⎢u+ u + s<strong>in</strong>( u)<br />
3 ⎥ (44)<br />
⎣<br />
⎦<br />
η1 = η2<br />
η =−2η − 0.2η + ξ<br />
2 1 2 1<br />
y = ξ<br />
1<br />
The control objective is to force the system output y<br />
to track the desired trajectory yd<br />
= 2s<strong>in</strong>t+ cos ( 0.5t).The<br />
simulation parameters are selected as follows:<br />
15 5<br />
Q = diag[10,10] , P = ⎡ ⎤<br />
⎢<br />
5 5 ⎥ , K = [ 1, 2]<br />
T<br />
, Ξ = 0.01 ,<br />
⎣ ⎦<br />
λ = 10 , γ = 11 , σ = 0.02 .<br />
θ<br />
T<br />
The output of RBFNN controller is uz ( ) = φ ( z)<br />
θ . The<br />
basis function vector is φ( z) = ( φ1<br />
( z) φ ( )) T<br />
M<br />
z , where<br />
T<br />
( z μ ) ( z μ )<br />
⎡− −<br />
i<br />
− ⎤<br />
i<br />
φi<br />
( z) = exp ⎢<br />
⎥, i = 1, , M . M is the<br />
2<br />
⎢⎣<br />
σ<br />
i ⎥⎦<br />
number of hidden layer nodes which is stable at the 33<br />
nodes by tra<strong>in</strong><strong>in</strong>g on-l<strong>in</strong>e us<strong>in</strong>g the GGAP-RBF<br />
algorithm.<br />
Accord<strong>in</strong>g to (23), the control law is<br />
T<br />
uz ( ) = φ ( z)<br />
θ<br />
θ =− 11 φ( z) e + e+ 2e + 10 tanh 100 × (5e+<br />
5 e<br />
)<br />
− 11×<br />
0.02θ<br />
{ ( )}<br />
The system <strong>in</strong>itial conditions are ξ = [ ]<br />
(0) 1 2 T<br />
.The<br />
simulation results us<strong>in</strong>g MATLAB are shown <strong>in</strong> Fig1, 2,<br />
3, 4.<br />
Figure 1. Plots of output track<strong>in</strong>g of system<br />
Figure 1 shows the result of output track<strong>in</strong>g, and the<br />
control <strong>in</strong>put signal is shown <strong>in</strong> Figure 2. The grow<strong>in</strong>g<br />
and prun<strong>in</strong>g automatically of hidden layer nodes are<br />
shown <strong>in</strong> Figure 3.<br />
Figure 2. Plots of Control <strong>in</strong>put<br />
Figure 3. Node Number of Hidden Layer<br />
© 2013 ACADEMY PUBLISHER