Академический Документы
Профессиональный Документы
Культура Документы
Recursive Approach
ME 4135 Robotics &
Controls
R. Lindeke, Ph. D.
Physical Basis:
F mi&C
N moment I CM i &i i I CM i i
i i ni
zi 1 (1 i ) fi
zi 1 bi q&i
parameter (is 1 if
revolute; 0 if
prismatic) like in
Jacobian!
k k 1 k q&k zk 1
&
&
&k &k 1 k q&
k zk 1 k 1 qk zk 1
Same as (dw/dt) the
angular acceleration in
dynamics
vk vk 1 k sk 1 k q&k zk 1
Normal component of
acceleration (centrifugal
acceleration)
To evaluate Link velocities & accelerations, start with the BASE (Frame0)
0 0
&0 0
v0 0
&0 g
rk ck d k
ck
nk nk 1 sk rk f k rk f k 1 Dk &k
k Dkk
k k nk zk 1 1 k f k zk 1 bk q&k
T
Step 2: Compute
Zk-1s
Step 4: Compute
rk (related to center of mass of Link k)
fk
(force on link k)
Dk R Dk R
k
0
Nk (moment
k T
0
on link k)
tk
Keeping it
Extremely Simple
This 1-axis robot
is called an
Inverted Pendulum
It rotates about z0
in the plane
c1 0
0
1
0 0 0
ma
D1
0
1
0
12
0 0 1
C1 S1 0 a1C1
S
C
0
a
S
1
1 1
T01 A1 1
0
0 1
0
0
0
0
1
2
1 1
Link is a thin
cylindrical rod
0 0 1 0
a1C1
2
aS
1 1
2
C1 S1 0 a1C1 a1
2
C1 0 a1S1 0
1
0
0 1
0
0
0 0 1
1
0
1 T
0
C1 S1 0
2
m1a1
S1 C1 0
12
0
0 1
S
S1C1
1
2
m1a1
2
C1
S1C1
12 0
0
0 0 0
C1 S 1 0
0 1 0 S1 C 1 0
0 0 1
0
0 1
0
0
1
0
0
1 0 q&1 0 q&1 0
1
1
0
0
q&
& 0
&
&1 0 q&
1 0
1
1
1
a1C1
1 0 0 0
a
S
s1 H o (O1 O0 ) 0 1 0 0 1 1
0
0 0 1 0
1
a1C1
a1S1
Linear Velocity:
v1 v0 1 s1 1 1 q&1 z0
0
0 q&1a1 0
1
S1
&
a1q1 C1
0
C1
S 1 1 q&
1
1
0
0
Linear Acceleration:
&
&
1 g 1 s1 1 1 s1
Note:
g = (0, -g0, 0)T
S1
0 S1
C q& 0 a q& C
&
g a1q&
1
1
1
1 1 1
0
1 0
S1
C1
C a q&
2 S
&
g a1q&
1
1
1 1
1
0
0
S1
C1
C a q&
2 S
&
g a1q&
1
1
1 1 1
0
0
Compute r1 to
begin Backward
Formations:
a1C1
2
a1C1
aS
1 1 a1S1
0
0
C1
a
1 S1
2
0
Finding f1
&
f1 m1{&
1 1 r1 1 1 r }
0
&
a1q&
1
0
2
1
Consider:
ftool = 0
m1{&
1
&
a1q&
1
m1{&
1
m1{&
1
m1
0
a q&
q&1 0 1 1
2
1
0 S1
2
a1q&1
0 C
1 }
2
1 0
C1
S
1
0
S1
C
C 1
0
0 S }
1
1
0
S1
C1
2
&
a1q&
C a1q&1 S }
1
1
2
2
0
0
S1
a q&
2
&
g a1q&
1 C1
1 1
0
C1
S1
C1
2
S a1 q&1 C a1q&1 S
1
1
1 2
2
0
0
0
f1 m1
m1
S1
2
&
a1q&
a1q&1
1
g
C1
2
2
0
&
&
a1 q&
1S1 q C1
2
1
g0
C1
S
1
0
&
&
a1 q&
1C1 q S
Note f1 is a Vector!
2
1 1
Computing n1:
n1 s1 r1 f1 D1&1 1 D11
C1
a1 S1 1
2
0
C1
a1
S1 m1
0
C1
2 0
2 2 0
&
m1a 1 q&
S f m1a 1 q&
1 0 0
1
0
1
1
12
12
0
1
1
1
2
&
&
a1 q&
S
q
1 1
1 C1
g0
2
&
&
a1 q&
C
q
1 1
1 S1
&
&
ma q
0 1 1 1
12
2
2
&
&
&
&
&
&
a
q
C
q
S
a
q
S
1
1 1
1 1
1
1 1
1 C1
a1m1
S1
C g
2 1 0
2
2
0
0
0
0
2
0 m1a1 q&
&
1
0
12
1
1
Simplifying:
0
m1 2
g 0 m1a1C1
&
n1 a1 q&
0
1
3
2
m1
0 0
3
0
0
g 0 m1a1C1
T
2
&
a1 q&
g 0 1 1 f g 0 b1 q&1
1
2
1
1
m1a12
g 0 m1a1C1
&
1
b1 q&1
q&
1
2
3
Homework Assignment: