Professional Documents
Culture Documents
Inverse
Inverse
Inverse
Inverse Kinematics
Jacobian Matrix
Trajectory Planning
Dr. Jizhong Xiao
Department of Electrical Engineering
City College of New York
jxiao@ccny.cuny.edu
• Review
– Kinematics Model
– Inverse Kinematics
• Example
• Jacobian Matrix
– Singularity
• Trajectory Planning
Ti i 1 T ( zi 1 , d i ) R ( zi 1 , i )T ( xi , ai ) R ( xi , i )
Reference C i C i S i S i S i ai C i
Coordinate S C i C i S i C i ai S i
i
0 S i C i di
0 0 0 1
C nx S n y XX XX 0
S n C n S s C s S a x C a y 0
x y x y
nz XX XX 0
0 0 0 1
C SS SC 0
0 C S 0
(Equation A)
S CS CC 0
0 0 0 1
The City College of New York 9
Review
• Compare LHS and RHS of Equation A, we have:
X X X C1 p x S1 p y X X X S 2 d 3
X X X pz X X X C 2 d 3
T16
X X X S1 p x C1 p y X X X 0.1
0 0 0 1 0 0 0 1
cos 1 p x sin 1 p y pz
2 a tan 2( ) d3
pz cos 2
The City College of New York 13
Example
• Solving the inverse kinematics of Stanford arm
X X S 5 0
X X C 5 0
(T34 ) 1 (T23 ) 1 (T12 ) 1 (T01 ) 1T06 T45T56
X X 0 0
From term (3,3) 0 0 0 1
S 6 C 5{C 4 [C 2 (C1s x S1s y ) S 2 s z ] S 4 ( S1s x C1s y )} S 5 [ S 2 (C1s x S1s y ) C 2 s z ]
C 6 S 4 [C 2 (C1s x S1s y ) S 2 s z ] C 4 ( S1s x C1s y )
S 6
6 a tan 2( )
C 6
1 x 1
Forward x
y y
2 2 Jacobian
3 z 3 Matrix z
Kinematics
4 4 x
5 y
5
6 Inverse 6 z
d dh(q ) dq dh(q )
Y61 h(qn1 ) q
dt dq dt dq
x
y q 1
q
z dh(q ) 2
dq Y61 J 6n q n1
x 6n
y dh(q)
q n n1 J
z dq
The City College of New York 17
Jacobian Matrix
x
y
q 1
z dh(q ) q 2 Jacobian is a function of
q, it is not a constant!
x dq 6n
y
q n n1
z h1 h1 h1
q
q2 qn
1
dh(q ) h2 h2
h2
J q1 q2 qn
dq 6n
h h6 h6
6
q1 q2 qn 6n
x 1
Y J
l1
y 2
1
h1 h1
2 l1 sin 1 l2 sin(1 2 ) l2 sin(1 2 )
J 1
h2 h2 l1 cos1 l2 cos(1 2 ) l2 cos(1 2 )
1 2
• Singularity
– rank(J)<min{6,n}, Jacobian Matrix is less than full rank
– Jacobian is non-invertable
– Boundary Singularities: occur when the tool tip is on the surface
of the work envelop.
– Interior Singularities: occur inside the work envelope when two or
more of the axes of the robot form a straight line, i.e., collinear
Det(J)=0 l11
x
The City College of New York 23
Jacobian Matrix
• Pseudoinverse
– Let A be an mxn matrix, and let A be the pseudoinverse
of A. If A is of full rank, then A can be computed as:
AT [ AAT ]1 mn
A A1 mn
[ AT A]1 AT mn
– Example:
1 0 2 3 x A b 1 / 9[5,13,16]T
1 1 0 x 2
1 1 1 1 4
T T 1 5 1 1
A A [ AA ] 0 1 1 5
1 2 9
2 0 4 2
The City College of New York 24
Robot Motion Planning
T asks
T ask P lan
• Path planning
– Geometric path
A ction P lan – Issues: obstacle avoidance, shortest
path
P ath P lan
• Trajectory planning,
T rajectory – “interpolate” or “approximate” the
P lan
desired path by a class of polynomial
C ontroller
functions and generates a sequence of
time-based “control set points” for the
R obot control of manipulator from the initial
configuration to its destination.
S ensor
(continuity,
sm oothness)
P ath
constraints
joint space
{q (t ), q (t ), q(t )}
P ath T rajectory sequence of control set points
or
specification P lanner along desired trajectory
• Acceleration Profile
t0 t1 t2 tf T im e
S peed
t0 t1 t2 tf T im e
A cceleration
t0 t1 t2 tf T im e
hn (t ) an 4t 4 an 3t 3 an 2t 2 an 2t an 0 t2tf, 5 unknow
• 3-5-3 trajectory
x
The City College of New York 34