Back Stepping and Non-CE Method
Back Stepping and Non-CE Method
Lecture 12 - 03/03/2015
(1)
1. Assuming is known
In order to design a controller for the above system we can use the classical backstepping design
approach. The control objective given as follows:
lim x1 0
lim x2 x2d
Where,
x2d = K1 x1 f (x1 )
(2)
1 2
x1
2
1
2
V2 = (x2 x2d )
2
V 2 = (x2 x2d )(u x 2d )
(3)
Consider the update law, u = x 2d K2 (x2 x2d ). Hence, the overall Lyapunov function is given as
follows:
V = V1 + V2
V = x1 x 1 K2 (x2 x2d )2
= x1 x2 + x1 f (x1 ) K2 (x2 x2d )
(x1 )
x2d = K1 x1 f
if x2 = x2d
(x1 )
x 1 = K1 x1 + f
1
(4)
1 2
1 2
x1 +
2
2
1
V1 = x1 x 1
Let us take
V1 =
(x1 )) 1
= x1 (K1 x1 + f
1 f (x1 ) )
= K1 x1 2 + (x
= x1 f (x1 )
V1 K1 x1 2
First Update
Let us take
1
(x2 x2d )2
2
V 2 = (x2 x2d )(x 2 x 2d )
V2 =
u = x 2d K2 (x2 x2d )
x 2d = K1 x 1 x1 f 2 (x1 ) f(x1 )
= K1 (x2 + f (x1 )) x1 f 2 (x1 ) f(x1 )
f
)(x2 + f (x1 )) x1 f 2 (x1 )
= (K1 +
x1
f
)(x2 + f (x1 )) x1 f 2 (x1 )
x
2d = (K1 +
x1
f
= x 2d + f (x1 )(K1 +
)
x1
W here =
Let the overall Lyapunov function V = V1 + V2 , where, V1 () and V2 () are given as follows:
1 2
1 2
x1 +
2
2
1
1 2
V2 = (x2 x2d )2 +
2
2
V1 =
second control
1
1
2d )
V = x1 x2 + x1 f (x1 ) x
1 f (x1 ) + (x2 x2d )(u x
u = x 2d K2 (x2 x2d )
f
= x 2d + f (x)(K1 +
)
x1
1 f (x1 ) K2 (x2 x2d )2
= x1 (x2 x2d ) + x1 x2d + x1 f (x1 ) x
f
1
+ (x2 x2d )f (x1 )(K1 +
)
x1 )
Second update
f
= (x2 x2d )f (x1 )(K1 +
)
x1
2
Non-certainty Equivalence
(5)
x = ax + bu
(6)
Let, 1 =
a
b
e = ax + bu r(t)
a
1
= b(u + x r(t))
b
b
and 2 = 1b . Reconsider the control law, u = 1 x 2 (Ke r)
1
a
e2f
2
V = Z Z + ef e f
= Z( | b | Wf T Wf Z) + ef (Kef bWf Z)
= | b | k Wf Z k2 Ke2f bef Wf Z
( | b |
b2
1
)kWf Zk2 (K )e2f
2
2