R: A C & A: Obotics Dvanced Oncepts

ROBOTICS : A DVANCED C ONCEPTS
&
A NALYSIS
M ODULE 3 K INEMATICS OF SERIAL ROBOTS
Ashitava Ghosal1
1 Department
of Mechanical Engineering
&
Centre for Product Design and Manufacture
Indian Institute of Science
Bangalore 560 012, India
Email: asitava@mecheng.iisc.ernet.in
NPTEL, 2010
.
A SHITAVA G HOSAL (IIS C )
ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS
NPTEL, 2010
1 / 96
.
. .1 C ONTENTS
.
. .2 L ECTURE 1
Introduction
Direct Kinematics of Serial Robots
.
. .3 L ECTURE 2
Inverse Kinematics of Serial Robots
.
. .4 L ECTURE 3
Inverse Kinematics of Serial Robots with n < 6
Inverse Kinematics of Serial Robots with n > 6
.
. .5 L ECTURE 4
Elimination Theory & Solution of Non-linear Equations
Inverse Kinematics of a General 6R Robot
.
. .6 A DDITIONAL M ATERIAL
Problems, References and Suggested Reading
.
NPTEL, 2010
2 / 96
O UTLINE
.
. .1 C ONTENTS
.
. .2 L ECTURE 1
Introduction
.
. .3 L ECTURE 2
.
. .4 L ECTURE 3
.
. .5 L ECTURE 4
.
.
NPTEL, 2010
3 / 96
I NTRODUCTION
Serial manipulators: One end fixed Links and joints

Free end with end-effector.
Kinematics Motion of (rigid) links without considering
force and torques.
Kinematics Study of geometry of motion.
Serial manipulators modeled using Denavit-Hartenberg
parameters (see Module 2, Lecture 2).
Two main problems: Direct Kinematics and Inverse
Kinematics.
NPTEL, 2010
4 / 96
E XAMPLES OF S ERIAL ROBOTS

3, X
T ool
X
{T ool}
T ool
Y
2
X
Link 3
l3
O3
{3}
3
Y
0
Y
1
Y
2
Y
Link 2
l2
{2}
1
X
{0}
O2
{1}
Link 1
l1
1
O1
0
X
(a) 3 DOF planar

Robot
(b) Six DOF

PUMA Industrial
Robot
Z 2
Z 1
2
{ 2}
{ 1}
X 2
X 1
d3
{ 3}
O 0, O1
O2
Z 3
{ 4}
O3, O4
(c) Six DOF T3

Robot
(d) 4 DOF
SCARA Robot
.
NPTEL, 2010
5 / 96
D EGREES OF F REEDOM (DOF)

Grbler-Kutzbachs criterion
J
DOF = (N J 1) + Fi
(1)
i=1
N Total number of links including the fixed link (or base),

J Total number of joints connecting only two links (if
joint connects three links then it must be counted as two
joints),
Fi Degrees of freedom at the i th joint, and = 6 for
spatial, 3 for planar manipulators and mechanisms.
PUMA 560 N = 7, J = 6, F1 = 1, = 6 DOF = 6.
Grbler criterion does not work for over-constrained
mechanisms (see Mavroidas and Roth(1995), Gan and
Pellegrino(2003), review paper by Gogu(2007)).
.
NPTEL, 2010
6 / 96
D EGREES OF F REEDOM (C ONTD .)

DOF The number of independent actuators.
DOF Capability of a manipulator with respect to .
...
...
...
1
DOF = End-effector can be positioned and oriented

arbitrarily.
DOF < DOF relationships containing the
position and orientation variables.
DOF > Position and orientation of the end-effector in
ways Redundant manipulators.
Serial manipulators with a fixed base, a free end-effector

and two links connected by a joint N = J + 1 and
DOF = Ji=1 Fi .
All actuated joints are one DOF joints J = DOF .
J > DOF J DOF joints are passive.
J < DOF One or more of the actuated joints are
multi-degree-of-freedom joints Rare in mechanical
manipulators but common in biological joints actuated with
muscles.
.
.
.
.
.
NPTEL, 2010
7 / 96
S OME D EFINITIONS
J joint variables i s or di s form the joint space.
Position and orientation variables form the task space
For planar motion, = 3 Task space (x, y , ).
For spatial motion, = 6 Task space (x, y , z; [R]).
Actuator space: due to mechanical linkages, gears, etc.

between actuators and joints, joint variables are not
identical to actuator variables
Dimension of actuator space is more than
Manipulator is redundant.
Dimension of actuator space is less than Manipulator
is under-actuated.
Manipulator/robot kinematics Functional relationship

between joint space and task space.
NPTEL, 2010
8 / 96
T WO P ROBLEMS IN K INEMATICS OF
S ERIAL ROBOTS
Direct Kinematics Problem:
Given the constant D-H link parameters and the joint
variable, ai1 , i1 , di , and i i = 1, 2, ..n, find the position
and orientation of the last link in a fixed or reference
coordinate system.
Most basic problem in serial manipulator kinematics.
Required to be solved for computer visualization of motion
and in off-line programming systems.
Used in advanced control schemes.
Inverse Kinematics Problem:

Given the constant D-H link parameters and the position
and orientation of the end-effector ({n}) with respect to
the fixed frame {0}, find the joint variables.
Harder than the direct kinematics problem.
Leads to the notion of workspace of a robot.
Required for computer visualization of motion and used in
advanced control schemes.
.
.
.
.
.
NPTEL, 2010
9 / 96
O UTLINE
.
. .1 C ONTENTS
.
. .2 L ECTURE 1
Introduction
.
. .3 L ECTURE 2
.
. .4 L ECTURE 3
.
. .5 L ECTURE 4
.
.
NPTEL, 2010
10 / 96
D IRECT K INEMATICS P ROBLEM

Since all D-H parameters are known All 4 4 link
transforms i1
i [T ], i = 1, .., n are known (see Module 2,
Lectures 2 and 3).
With respect to {0}, the position and orientation of {n} is
0 [T ] = 0 [T ]1 [T ]......n1 [T ].
n
n
1
2
[T ] = Base
[T ]0n [T ].
For another reference {Base}, Base
n
0
Base
Note: 0 [T ] must be known.
As discussed in Module 2, Lecture 2, Slide # 41, the
end-effector geometry does not appear in 0n [T ].
To obtain Base
Tool [T ], perform the matrix multiplication
Base [T ]0 [T ]n
n
n
0
Tool [T ]; Tool [T ] must be known.
One advantage of the used D-H convention: Manipulator
transform 0n [T ] can be computed only once and need not
be changed if location of {Base} or the geometry of
end-effector nTool [T ] changes Recall a robot can have a
variety of end-effectors!
.
NPTEL, 2010
11 / 96

The direct kinematics problem can be always solved for any
serial manipulator!
The solution procedure is simple Involves only
multiplication of matrices.
Examples 1: A planar 3R
manipulator (see Slide # 47,
Lecture 3, Module 2).
represents orientation of
the tool.
From 0Tool [T ]
3, X
T ool
X
{T ool}
T ool
Y
2
X
Link 3
l3
O3
{3}
3
Y
0
Y
1
Y
2
Y
Link 2
l2
1
X
{2}
{0}
x
y
= l1 c1 + l2 c12 + l3 c123
= l1 s1 + l2 s12 + l3 s123
= 1 + 2 + 3
(2)
O2
{1}
Link 1
l1
1
0
X
O1
Figure 1: The planar 3R manipulator

.
NPTEL, 2010
12 / 96
D IRECT
SCARA
K INEMATICS
P ROBLEM :
Example 2 A SCARA manipulator
Z 2
Z 1
the {4}.
The position, (x, y , z), and
orientation of {4} is
2
{ 2}
{ 1}
X 2
X 1
d3
{ 3}
O 0, O1
O2
Z 3
x
y
z
{ 4}
O3, O4
=
=
=
=
a1 c1 + a2 c12
a1 s1 + a2 s12
d3
1 + 2 + 4
(3)
Figure 2: A SCARA manipulator

.
NPTEL, 2010
13 / 96

PUMA 560
Example 3: PUMA 560 manipulator (Slide #s 5256,
Lecture 3, Module 2)
0 [T ] = 0 [T ]3 [T ] Orientation and position
6
3
6
r11
r21
r31
r12
r22
r32
r13
r23
r33
O6x
O6y
O6z
=
=
=
=
=
=
=
=
=
=
=
=
c1 {c23 (c4 c5 c6 s4 s6 ) s23 s5 c6 } + s1 (s4 c5 c6 + c4 s6 )

s1 {c23 (c4 c5 c6 s4 s6 ) s23 s5 c6 } c1 (s4 c5 c6 + c4 s6 )
s23 (c4 c5 c6 s4 s6 ) c23 s5 c6
c1 {c23 (c4 c5 s6 s4 c6 ) + s23 s5 s6 } + s1 (s4 c5 s6 + c4 c6 )
s1 {c23 (c4 c5 s6 s4 c6 ) + s23 s5 s6 } c1 (s4 c5 s6 + c4 c6 )
s23 (c4 c5 s6 s4 c6 ) + c23 s5 s6
c1 (c23 c4 s5 + s23 c5 ) s1 s4 s5
s1 (c23 c4 s5 + s23 c5 ) + c1 s4 s5
s23 c4 s5 c23 c5
x = c1 (a2 c2 + a3 c23 d4 s23 ) d3 s1
y = s1 (a2 c2 + a3 c23 d4 s23 ) + d3 c1
z = a2 s2 a3 s23 d4 c23
.
.
.
.
.
.
(4) 14 / 96
NPTEL, 2010
S UMMARY
Direct kinematics: Given D-H parameters, find position and

orientation of end-effector.
Direct kinematics problem can always be solved for any
number of links.
Direct kinematics can be solved using matrix multiplication.
Direct kinematics in serial manipulators is unique.
Direct kinematics problem for serial manipulators is the
simplest problem!
NPTEL, 2010
15 / 96
O UTLINE
.
. .1 C ONTENTS
.
. .2 L ECTURE 1
Introduction
.
. .3 L ECTURE 2
.
. .4 L ECTURE 3
.
. .5 L ECTURE 4
.
.
NPTEL, 2010
16 / 96
I NTRODUCTION
Inverse Kinematics Problem (restated): Given the constant
D-H link parameters and 0n [T ], find the joint variables
i , i = 1, .., n.
For 3D motion, 6 task space variables 3 position + 3
orientation in 0n [T ].
For planar motion, 3 task space variables 2 position + 1
orientation in 0n [T ].
Following cases possible:
...
...
n = 6 for 3D motion or n = 3 for planar motion Same

number of equations as unknowns.
2 n < 6 for 3D motion or n < 3 for planar motion Number
of task space variables larger than number of equations and
hence there must be (6 n) ((3 n) for planar)
relationships involving the task space variables.
.3. n > 6 for 3D motion or n > 3 for planar motion More
unknowns than equations and hence infinite number of
solutions Redundant manipulators.
1
Start with the simplest case of planar 3R manipulator.

.
NPTEL, 2010
17 / 96
P LANAR 3R M ANIPULATOR
Direct kinematics
equations
x
y
= l1 c1 + l2 c12 + l3 c123
= l1 s1 + l2 s12 + l3 s123
= 1 + 2 + 3
3, X
T ool
X
{T ool}
2
X
Link 3
l3
T ool
Y
O3
Inverse Kinematics: Given

(x, y , ) obtain 1 , 2 and
3 .
Solution of system of
non-linear transcendental
equations.
No general methods (as in
linear equations) exists
Solution procedure
depends on problem.
{3}
3
Y
0
Y
1
Y
2
Y
Link 2
l2
1
X
{2}
{0}
O2
{1}
Link 1
l1
1
0
X
O1
Figure 3: The planar 3R manipulator

.
NPTEL, 2010
18 / 96
I NVERSE K INEMATICS A LGORITHM

Define X = x l3 c and Y = y l3 s X and Y are
known since x, y , and l3 are known.
Squaring and adding
X 2 + Y 2 = l12 + l22 + 2l1 l2 c2
From equation (5)
2 = cos
X 2 + Y 2 l12 l22
2l1 l2
(5)
)
(6)
Once 2 is known
1 = atan2(Y , X ) atan2(k2 , k1 )
(7)
where k2 = l2 s2 and k1 = l1 + l2 c2 . Note: atan2(y , x) is the

four quadrant arc-tangent function and 1 [0, 2 ].
Finally, 3 is obtained from
3 = 1 2
(8)
.
NPTEL, 2010
19 / 96
3R M ANIPULATOR W ORKSPACE
Workspace: All (x, y , )
such that inverse
kinematics solution exists.
From equation (6)
X 2 +Y 2 l12 l22
1 (
) +1
2l1 l2
or
Figure 4 shows the region

in {x, y , } space where
the above inequalities are
satisfied and the inverse
kinematics solution exists.
6
phi axis
(l1 l2 )2 (X 2 +Y 2 ) (l1 +l2 )2

(9)
where X = x l3 c and
Y = y l3 s .
0
10
10
5
5
0
0
5
5
Y axis
10
X axis
10
Figure 4: Workspace of a planar 3R

robot
.
NPTEL, 2010
20 / 96
3R M ANIPULATOR :
(C ONTD .)
W ORKSPACE
l1 + l2 + l3
l1 + l2 l3
0
Y
0
X
Configuration 2
Cofiguration 1
l1 l2 + l3
l1 l2 l3
Figure 5: Projection of workspace of a planar 3R robot
0 Y0 plane for
Projection of the workspace on X
l1 > l2 > l3 Four circles of radii l1 + l2 + l3 , l1 + l2 l3 ,
l1 l2 + l3 and l1 l2 l3 .
.
.
.
.
NPTEL, 2010
21 / 96
3R M ANIPULATOR :
(C ONTD .)
W ORKSPACE
Reachable Workspace: All (x, y ) between maximum reach

(l1 + l2 + l3 ) and minimum reach (l1 l2 l3 ).
Dexterous Workspace: All (x, y ) between radii (l1 + l2 l3 )
and (l1 l2 + l3 ).
All points inside dexterous workspace can be reached with
any (Kumar and Waldron, 1980).
As size of end-effector l3 increases, reachable workspace
increases and dexterous workspace decreases!
Intuitively correct With a long stick one can reach far
but with less freedom in orientation.
NPTEL, 2010
22 / 96
3R M ANIPULATOR : U NIQUENESS OF
IK S OLUTIONS
Equation (6) revisited:
2 = cos1
X 2 + Y 2 l12 l22
2l1 l2
For any (X , Y ) two values of 2 . The two solutions merge

at the workspace bounday.
A given (X , Y ) can be achieved by two configurations as
shown in Figure 5.
For planar 3R manipulator (x, y , ) yields two sets of
values of i , i = 1, 2, 3.
Inverse kinematics problem does not give unique solution
Compare with direct kinematics!
Existence and uniqueness issues important and non-trivial
in solutions of almost all non-linear equations.
.
NPTEL, 2010
23 / 96
PUMA 560 M ANIPULATOR

2
Z
{2}
2
X
2
Y
1
Z
{1}
3
Z
1
Y
{3}
O3
1
X
a2
3
X
d4
4
X
3
Y
d3
{4}
3
X
O1 , O2
a3
O4
O3
3
Y
6
X
5
X
{5}
{6}
4
X
4
Y
4
Z
{3}
6
Z
{4}
4
Z
(a) The PUMA 560 manipulator
5
Y
O4 , O5 , O6
(b) PUMA 560 - forearm and wrist
Figure 6: The PUMA 560 manipulator
Origins of {4}, {5} and {6} are coincident Known as

the wrist point.
.
NPTEL, 2010
24 / 96
PUMA 560: I NVERSE K INEMATICS

Position vector 0 O6 of the wrist point is only a function of
1 , 2 and 3 .
From equation (4),
x
= c1 (a2 c2 + a3 c23 d4 s23 ) d3 s1
= s1 (a2 c2 + a3 c23 d4 s23 ) + d3 c1
= a2 s2 a3 s23 d4 c23
(10)
where ci , si denote cos(i ), sin(i ), respectively and a2 ,a3 ,

d3 , d4 denote constant D-H parameters.
From the first two equations: s1 x + c1 y = d3
Transcendental equation in sine and cosine of 1 which can
be solved to obtain two sets of values for 1 .
.
NPTEL, 2010
25 / 96
PUMA 560: IK (C ONTD .)

Substitute tangent half-angle formulas from trigonometry
x1 = tan
1
,
2
c1 =
1 x12
,
1 + x12
s1 =
2x1
1 + x12
(11)
in s1 x + c1 y = d3
gives x12 (d3 + y ) + (2x)x1 + (d3 y ) = 0
Solve quadratic in x1 and take tan1 to get
x x 2 + y 2 d32
1 = 2tan1
y + d3
(12)
Note 1: tan1 gives an angle between 0 and and hence

0 1 2 .
Note 2: Two possible values of 1 due to the before
square root.
.
NPTEL, 2010
26 / 96

Squaring and adding expressions for x, y and z
x 2 + y 2 + z 2 = d32 + a22 + a32 + d43 + 2a2 a3 c3 2a2 d4 s3
Using tangent half-angle formulas
d4 d42 + a32 K 2
3 = 2tan1
K + a3
(13)
K = (1/2a2 )(x 2 + y 2 + z 2 d32 a22 a32 d42 ).

Two sets of values of 3 .
The expression for z is only a function of 2 and 3 .
Hence, s2 (a2 + a3 c3 d4 s3 ) + c2 (a3 s3 d4 c3 ) = z
Solve for 2 (for known 3 ) using tangent half-angle
substitutions
2 = 2tan
a2 a3 c3 + d4 s3
a22 + a32 + d42 + 2a2 (a3 c3 d4 s3 ) z 2
z (a3 s3 + d4 c3 )
(14)
Two possible values of 2 in the range. [0, 2. ].

NPTEL, 2010
27 / 96

To obtain 4 , 5 and 6 , form
c4 c5 c6 s4 s6 c4 c5 s6 s4 c6 c4 s5
3
s 5 c6
s5 s6
c5
6 [R] =
s4 c5 c6 c4 s6 s4 c5 s6 c4 c6
s4 s5
(15)
Since
3
6 [R]
= 03 [R]T 06 [R]
(16)
and since 1 , 2 and 3 are known, right-hand side is

known!
Compare known right-hand side with elements of 36 [R] and
obtain 4 , 5 and 6
Similar to Z Y Z Euler angles with Y rotation of
(5 ) See Slide # 16, Lecture 2, Module 2.
.
NPTEL, 2010
28 / 96

Algorithm rij 4 , 5 and 6
If r23 = 1, then
2 + r 2 ), r )
5 = atan2( (r21
23
22
4 = atan2(r33 /s5 , r13 /s5 ),
6 = atan2(r22 /s5 , r21 /s5 )
Else
If r23 = 1, then
4 = 0
5 = 0,
6 = atan2(r12 , r11 ),
If r23 = 1, then
4 = 0
5 = ,
6 = atan2(r12 , r11 ).
.
NPTEL, 2010
29 / 96
PUMA 560:
S OLUTIONS
U NIQUENESS OF IK
From equation (11) two sets of 1 .

From equation (13) two sets of 3 .
Since 3 appears on the right-hand side of equation (14)
Four possible values of 2 .
Two possible sets of 4 , 5 and 6 from inverse Euler angle
algorithm.
Overall eight possible sets of joint angles i , i = 1, .., 6 for
a given 06 [T ].
NPTEL, 2010
30 / 96
PUMA 560: W ORKSPACE

Usual definition: All 06 [T ] (position and orientation of {6})
such that inverse kinematics solution exists.
Six dimensional entity Difficult to imagine or describe!
Possible to derive the position workspace of wrist point.
Position vector of wrist point
x
= c1 (a2 c2 + a3 c23 d4 s23 ) d3 s1
= s1 (a2 c2 + a3 c23 d4 s23 ) + d3 c1
= a2 s2 a3 s23 d4 c23
(17)
(x, y , z) are functions of three independent variables 1 , 2

and 3 Represents a solid in 3D space.
Can obtain equations of the bounding surfaces.
.
NPTEL, 2010
31 / 96
PUMA 560: W ORKSPACE (C ONTD .)

Squaring and adding the three equations in equation (17)
gives
R 2 = x 2 + y 2 + z 2 = K1 + K2 c3 K3 s3
where K1 , K2 , and K3 are constants.
The envelope of this family of surfaces must satisfy
R2
=0
3
which gives K2 s3 + K3 c3 = 0.
Eliminating 3 and denoting a32 + d42 by l 2 , gives
[x 2 +y 2 +z 2 ((a2 +l )2 +d32 )][x 2 +y 2 +z 2 ((a2 l )2 +d32 )] = 0
(18)
which implies that the bounding surfaces are spheres.
At every point in the solid all possible orientations, except
two special singular configurations when r23 = 1, are
possible.
.
NPTEL, 2010
32 / 96

Numerical example of a PUMA 560 manipulator
For the PUMA 560, the Denavit-Hartenberg parameters are
i
1
2
3
4
5
6
i1
degrees
0
-90
0
-90
90
-90
ai1
m
0
0
0.4318
0.019
0
0
i
degrees
45
60
135
30
-45
120
di
m
0
0
0.125
0.432
0
0
For the above D-H table
0.9749 0.2192 0.0388 0.1304

0.1643 0.8262 0.5388 0.3071
0
6 [T ] =
0.1502 0.5190
0.8415 0.0482
0
0
0
1
.
NPTEL, 2010
33 / 96

Numerical example of a PUMA 560 manipulator
For the above 06 [T ], the inverse kinematics solutions are
i
1
2
3
4
5
6
7
8
1
-91
-91
45
45
-91
-91
45
45
2
120
120
-77.73
-77.73
-102.27
-102.27
60
60
3
50.04
50.04
50.04
50.04
135
135
135
135
4
177.51
-2.49
85.25
-94.75
92.28
-87.72
30
210
5
-42.65
42.65
-159.22
159.22
-178.31
178.31
-45
45
6
105.34
-74.66
-132.87
47.13
15.79
-164.21
120
300
Note: As expected, one of the solutions (set 7) matches the

chosen values of i , i = 1, ..., 6, in the direct kinematics.
.
NPTEL, 2010
34 / 96

Workspace of wrist point of the PUMA shown in Figure 7.
Note: Actual workspace is subset of shown workspace due to
joint rotation limits.
0.8
0.6
0.4
Z axis
0.2
0
0.2
0.4
0.6
0.8
0.8
0.6
0.4
0.2
0
0.2
0.4
0.6
0.8
Y axis
1
0.8
0.6
0.4
0.2
0.2
0.4
0.6
0.8
X axis
Figure 7: Workspace of the wrist point of the PUMA

.
NPTEL, 2010
35 / 96
R EVIEW OF IK
Transcendental equations Polynomial equations using
tangent half angle substitution.
Polynomial equation of higher degree Linear in sin( ) or
cos( ) Quadratic in x 2 with x = tan( 2 ).
For analytical solutions to IK Eliminate joint variable(s)
from set of non-linear equations in several joint variables
A single equation in one joint variable.
Planar 3R example Three equations in three joint
variables Two equations in 1 and 2 One equation,
equation (5), in 2 alone.
Single equation solved for 2 and then solve for 1 and 3 .
PUMA 560 3 equations in first 3 joint variables.
Solve for the first 3 joint joint variables and then for last 3
joint variables using orientation information.
Decoupling of the position and orientation was first noticed
by Pieper (Pieper, 1968) for manipulators with intersecting
wrist. Later generalised to any six DOF serial
wrist-decoupled manipulators where three consecutive
.
.
.
.
.
joint axes intersect.
NPTEL, 2010
36 / 96
R EVIEW OF IK (C ONTD .)
For all six DOF serial manipulators, with three joint axes
intersecting At most a fourth-order polynomial in the
tangent of a joint angle need to be solved.
The manipulator wrist point can reach any position in the
workspace in at most four possible ways.
Fourth-degree polynomials can be solved in closed-form
(Korn and Korn, 1968) IK of all six- degree-of-freedom
serial manipulators with three intersecting axes can be
solved in closed-form.
PUMA 560 Workspace of the wrist point is bounded by
two spheres and require solution of only a quadratic due to
special geometry.
General geometry robot with intersecting wrist, boundaries
of the solid region traced by wrist point form a torus, a
fourth-degree surface (Tsai and Soni, 1984).
.
NPTEL, 2010
37 / 96
N ON - INTERSECTING WRISTS
Difficult to design/manufacture three intersecting axis
wrist.
Much easier if wrist has two intersecting axis.
2
D-H parameters
6
5
4
3
5
R Joint
R Joint
R Joint
i
1
2
3
4
5
6
i1
0
/2
0
/2
/2
/2
ai1
0
0
a2
a3
0
0
di
0
0
d3
d4
d5
0
i
1
2
3
4
5
6
Figure 8: A robot with non-intersecting wrist

.
NPTEL, 2010
38 / 96
Figure 8 shows a six- degree-of-freedom robot First 3
joint axis are similar to PUMA 560.
Last three axes do not intersect and there is an offset d5 .
From D-H table compute 01 [T ], ..., 56 [T ] and then 06 [T ].
Last column of 06 [T ] is
x
= c1 (a2 c2 + a3 c23 d4 s23 ) d3 s1 + d5 (s1 c4 c1 s4 c23 )
= s1 (a2 c2 + a3 c23 d4 s23 ) + d3 c1 d5 (c1 c4 + s1 s4 c23 )
= a2 s2 a3 s23 d4 c23 d5 s4 s23
(19)
Note: (x, y , z) is a function of 1 , 2 , 3 and 4 .

Need one more equation in the four joint variables!
NPTEL, 2010
39 / 96
T0
6 [R],
From 36 [R] = 03 [R]
c4 c5 c6 s4 s6
c4 c5 s6 s4 c6 c4 s5
s5 c6
s5 s6
c5
s4 c5 c6 c4 s6
s4 c5 s6 c4 c6
s4 s5
c1 c23
s1 c23
s23
r11 r12
c1 s23 s1 s23 c23 r21 r22
s1
c1
0
r31 r32
r13
r23 (20)
r33
Divide the (1, 3) and the (3, 3) terms of the above matrix
equation, to get (for 5 = 0, ),
s4 (r13 c1 c23 + r23 s1 c23 + r33 s23 ) = c4 (r13 s1 r23 c1 )
(21)
Equation (21) is the fourth equation!

Solve numerically equations (19) and (21) to obtain
i , i = 1, 2, 3, 4.
Solve for 4 , 5 and 6 using Z (Y ) Z inverse Euler
angle algorithm (similar to PUMA 560 example).
.
NPTEL, 2010
40 / 96
Numerical values of D-H parameters same as PUMA 560.
Offset d5 is chosen to be 20 mm.
0 [T ] same as used for the PUMA 560 example
6
0.9749 0.2192 0.0388 0.1304

0.1643 0.8262 0.5388 0.3071
0
6 [T ] =
0.1502 0.5190
0.8415 0.0482
0
0
0
1
Solve 4 non-linear equations numerically Function fsolve
R
used here.
in Matlab
1 = 41.82, 2 = 60.43, 3 = 135.33, 4 = 31.96

Using inverse Euler angle algorithm 2 sets of values
4 = 31.96, 148.04, 5 = 45.22, +45.22, and
6 = 121.57, 58.43 One 4 matches.
5 = 0, Singular configuration for the non-intersecting
wrist and only 4 6 can be found.
.
NPTEL, 2010
41 / 96
S UMMARY
Inverse kinematics: Given end-effector position and
orientation and constant D-H parameters, obtain joint
variables.
Number of joint variables must be 3 (for planar motion)
and 6 (for 3D motion).
Involve solution of a set of non-linear (transcendental)
equations No general approach IK of serial manipulators.
Existence of solution Workspace of serial manipulator.
Order of polynomial Number of configurations possible
for given end-effector position and orientation.
Planar 3R manipulator IK can be solved easily,
reachable and dexterous workspace.
PUMA 560 has 8 configurations, general 6R has 16
possible configurations.
.
NPTEL, 2010
42 / 96
O UTLINE
.
. .1 C ONTENTS
.
. .2 L ECTURE 1
Introduction
.
. .3 L ECTURE 2
.
. .4 L ECTURE 3
.
. .5 L ECTURE 4
.
.
NPTEL, 2010
43 / 96
I NTRODUCTION
0 [T ]
n
{0}.
define position and orientation of {n} with respect to
0 [T ],
n
in general, provide up to 6 (for 3D) and 3 (for

planar) task space pieces of information. Note: n is the
number of unknown joint variables.
If n < 6 for 3D motion or n < 3 for planar motion There
exists (6 n) ((3 n) for planar) functional relationships
involving the task space variables Constrained
manipulators.
Functional relationships obtained by inspection of geometry
or by using theory of elimination (see Lecture 4).
Start with a simple example of n < 6.
NPTEL, 2010
44 / 96
SCARA ROBOT
0 [T ]
4
contain position and

orientation of {4}.
Z 2
Z 1
2
{ 2}
{ 1}
X 2
X 1
d3
{ 3}
O 0, O1
O2
Z 3
{ 4}
O3, O4
Figure 9: A SCARA manipulator
Due to geometry and seen

from figure only angle
{4} Other two Euler
angles are zero!
Hence only the position
(x, y , z) and the angle of
{4} is relevant Equal
number of equations and
unknowns.
x
y
z
a1 c1 + a2 c12
a1 s1 + a2 s12
d3
1 + 2 + 4
=
=
=
=
.
(22)
NPTEL, 2010
45 / 96
SCARA ROBOT (C ONTD .)

Inverse kinematics solutions of SCARA robot can be
obtained from equation (22).
The unknown joint variables are:
2
1
d3
4
=
=
=
=
x 2 +y 2 l 2 l 2
1
2
)
cos1 (
2l1 l2
atan2(y , x) atan2(l2 s2 , l1 + l2 c2 )
z
1 2
(23)
Two possible sets of joint variables for a give (x, y , z, ).

Workspace: All reachable points (x, y , z) lie in an annular
cylinder of inner and outer radii given by l1 l2 and l1 + l2
(l1 > l2 ) respectively.
.
NPTEL, 2010
46 / 96
O UTLINE
.
. .1 C ONTENTS
.
. .2 L ECTURE 1
Introduction
.
. .3 L ECTURE 2
.
. .4 L ECTURE 3
.
. .5 L ECTURE 4
.
.
NPTEL, 2010
47 / 96
R EDUNDANT M ANIPULATORS
If n > 6 for 3D motion or n > 3 for planar motion More
unknowns than equations and hence infinite number of
solutions Redundant manipulators.
A simple example of a planar 3R robot but not interested
in orientation of the last link.
Direct kinematics equations are
x
y
= l1 c1 + l2 c12 + l3 c123
= l1 s1 + l2 s12 + l3 s123
(24)
Inverse kinematics: Given (x, y ) find 1 , 2 and 3 .

Two equations and 3 variables number of i , i = 1, 2, 3.
NPTEL, 2010
48 / 96
R EDUNDANT M ANIPULATORS
Need to use additional equation so that unique
i , i = 1, 2, 3 can be obtained.
Optimisation of a function of joint variables (Nakamura,
1991)
Minimisation of joint rotations, velocities and acceleration.
Avoiding obstacles and singularities.
Minimisation of actuator torques.
Resolution of redundancy: Obtaining additional useful and

meaningful equation(s) or constraint(s) to obtain unique
joint values.
Two resolution schemes
...
...
1
Minimise joint rotations Illustrated using the planar 3R

example.
Minimise Cartesian motion of links.
.
NPTEL, 2010
49 / 96
M INIMISE J OINT ROTATIONS

For planar 3R manipulator minimise joint rotation
Minimise 12 + 22 + 32 .
Optimisation problem: Minimize f ( ) = 12 + 22 + 32
subject to
g1 ( ) = x + l1 c1 + l2 c12 + l3 c123 = 0
g2 ( ) = y + l1 s1 + l2 s12 + l3 s123 = 0
= (1 , 2 , 3 )T , and (x, y ) denote trajectory of

end-effector.
Solve using classical method of Lagrange multipliers
Form the function
F ( ) = f ( ) 1 g1 ( ) 2 g2 ( )
(25)
Equate the derivatives of F ( ) to zero
f
g1
g2
= 1
+ 2
g1 ( ) = g2 ( ) = 0
.
(26)
.
NPTEL, 2010
50 / 96

Eliminate 1 and 2 by rewriting the first equation as
f g g
1
2
1
1
1
1
f g1 g2
(27)
2 2 2 1 = 0
g1
g2
f
2
3
For non-trivial 1 and 2 Equate determinant of the

3 3 matrix to zero to yield
l1 l2 3 s2 + l2 l3 (1 2 )s3 + l3 l1 (3 2 )s23 = 0
(28)
Solve equation (28) together with g1 ( ) = 0 and g2 ( ) = 0

numerically.
Figure 10 shows the plot of 1 , 2 , 3 , and f ( ).
.
NPTEL, 2010
51 / 96

l1 , l2 , and l3 are chosen to be 5, 3, and 1, respectively.
The end-effector traces a straight line parallel to the Y axis.
2.5
2
1.5
1
0.5
0
0.5
(Theta1)min
data1
(Theta2)min
data2
(Theta3)min
data3
sigma(theta
i 2) min
data4
1
1.5
2
2.5
6
< Y coordinate of the trajectory >
5
The trajectory
choosen
25
20
15
10
10
15
20
25
Figure 10: Plot of joint variables for redundant planar 3R robot

.
NPTEL, 2010
52 / 96
M INIMISE JOINT ROTATIONS WITH

JOINT CONSTRAINTS
Solve same optimisation problem with 120 2 120 .
All joint variables different when 2 is constrained.
Joint 2 restricted between 120 to 120 degrees
2.5
2
1.5
1
0.5
0
0.5
(Theta1)min
(Theta2)min
(Theta3)min
sigma(theta i 2)min
1
1.5
2
2.5
6
< Y co ordinate of the trajectory >
A view of work space

Trajectory on which
minimization points
were found and plotted
above
25
20
15
10
10
15
20
25
Figure 11: Plot of joint variables for redundant planar 3R robot with joint limit
.
NPTEL, 2010
53 / 96
M INIMISE C ARTESIAN MOTION OF

LINKS
A link moves such that

the head P moves along
the X axis and the
velocity of tail j0 is
along the link.
The curve traced by the
tail is the tractrix.
10
O
j0
Y-axis
Classical tractrix curve

called hund or hound
curve by Leibniz.
8
dy
6
dr
O
dx
tractrix
4
2
j1
0
S
0
P
5
P'
dp
X-axis 10
15
Figure 12: Motion of a link when one end is

pulled parallel to X axis
See link1 for more details on tractrix curve.

1 See
Module 0, slide #10 for Known Bugs in viewing

.
. links.
.
NPTEL, 2010
54 / 96
T RACTRIX EQUATION
Since the velocity vector at j0 is always aligned with the
link, the tractrix equation is
dy
y
=
dx
L2 y 2
(29)
where L is length of the link.

Solution in closed form and parametric form
x = L log
L2 y 2
L L2 y 2
p
p
x(p) = p L tanh( ), y (p) = L sech( )
L
L
(30)
Some key properties of the tractrix curve

For an infinitesimal motion of head dp, the length of path
traversed by tail dr is minimum of all possible paths.
dr dp and equal when velocity of head is along link.
.
NPTEL, 2010
55 / 96
T RACTRIX E XTENSION TO MOTION

ALONG ARBITRARY DIRECTION
14
10
8
6
4
2
X'
1
m1 < 0
Modified differential
equation of tractrix
dy
y ye
dx = xxe
(x ,y)
points
on
tractrix
Y'
Y - axis
12
Head moving along

ye = mxe , m = yp /xp ,
(xp , yp ) destination point.
m1 > 0
Solution is
B 2 4AC
xe = B 2A
where
2
A = 1+m ,B =
2my +2x, C = x 2 +y 2 L2 .
ye = m x e
2
0
2
X - axis
0
10
Figure 13: Motion of a link when one

end is pulled along a line ye = mxe
15
+ sign when slope of the

link (m1 ) in X Y is
negative and vice versa.
Initially as head moves along X , the tail moves backward!

.
NPTEL, 2010
56 / 96
T RACTRIX E XTENSION TO SPATIAL

MOTION
Algorithm TRACTRIX3D
.1. Define S = Xp Xh , Xh is current location of head.
.2. Define T = X Xh , X = (x, y , z)T is the tail of the link
lying on the tractrix.
.3. Define reference frame {r } with the X -axis along S.
r = ST .
.4. Define the Z -axis as Z
|ST|
.5. Define rotation matrix 0r [R] from X , Y and Z axis.
r T and parameter p from
.6. Obtain y = Y
1 y
p = L sech ( L ) |S|.
.7. From p obtain (xr , yr ) in {r }
(p )
(p )
xr = |S| L tanh
, yr = L sech
(31)
L
L
.8. Obtain (x, y , z)T in {0} from
(x, y , z)T = Xh + 0r [R](xr , yr , 0)T .
.
.
.
.
.
.
.
.
.
.
.
.
.
NPTEL, 2010
57 / 96
R ESOLUTION OF
USING T RACTRIX
R EDUNDANCY
Consider a redundant manipulator with n links and joints

j1 , j2 , ..., jn1 where ji is the joint connecting link li and
link li+1 Joints are either spherical joints or rotary.
Consider the last two links ln and ln1 Head of the link
ln denoted by jn is to be moved to jnnew given by
Xp = (xp , yp , zp )T .
Obtain new displaced location of tail jn1 using algorithm
TRACTRIX3D Denote by X = (x, y , z)T .
Tail of the link ln is the head of the link ln1 Desired
location of head of the link ln1 is (x, y , z)T .
Obtain location of the tail of link ln1 using algorithm
TRACTRIX3D.
Recursively obtain the motion of the head and tail of all
links down to the first link l1 .
.
NPTEL, 2010
58 / 96
A LGORITHM FOR RESOLUTION OF

REDUNDANCY USING TRACTRIX
Algorithm RESOLUTION-TRACTRIX
.1. Input desired location of head of link ln (xp , yp , zp )T and
set jnnew = (xp , yp , zp )T .
.2. for i : n to 1
.
.
...
3
Call TRACTRIX3D and obtain location of the tail of link i

(x, y , z)T
i 1
Set new location of head of link i 1, ji 1new (x, y , z)T
i 1
At end of step 2, j0 , would have moved. To fix j0

Move j0 to the origin (0, 0, 0)T and translate rigidly all
other links with no rotations at the joints.
Due to rigid translation, the end-effector will not be at
the desired (xp , yp , zp ).
Repeat step 2 and 3 until the head reaches (xp , yp , zp ) and
the point j0 is within a prescribed error bound of (0, 0, 0).
See also Reznick and Lumelsky(1992, 1993, 1995).

.
NPTEL, 2010
59 / 96
P ROPERTIES
OF
A LGORITHM
RESOLUTION-TRACTRIX
...
1
...
2
...
...
3
Algorithm complexity O(n), n is the number of rigid links

Amenable for real time computation.
i is given by i = cos1 (ji1 ji (k + 1) ji1 ji (k)) where
ji1 ji (k) is the unit vector from the tail to the head of the
i-th link at k-th instant.
Resolution of redundancy in Cartesian space and then the
joint angles are computed.
Head of link ln moves by drn , displacements obey the
inequality dr0 dr1 ... drn1 drn .
The motion of the links appears to die out as we move
toward the first link.
Joints near to base see large inertia and a desirable
strategy would be to move them the least.
...
5
To fix the tail of the first link, perform iterations of step 3

Convergence is guaranteed due to dying out property.
.
NPTEL, 2010
60 / 96
E XPERIMENTAL H ARDWARE
Experimental 8-link planar manipulator Each link is 70
mm long.
Joint driven by Futaba S3003 RC hobby servos.
Figure 14: Experimental 8-link hyper-redundant manipulator.

.
NPTEL, 2010
61 / 96
S IMULATION R ESULTS
Path traced by endeffector
Path traced by endeffector
500
500
Endeffector trajectory
Tractrix solution
Pseudoinverse solution
Modal solution
400
Endeffector trajectory
Tractrix solution
Pseudoinverse solution
Modal solution
400
300
300
2
200
100
200
100
6
100
200
300
200
100
200
300
400
100
500
300
100
200
300
400
500
(a) Desired straight line motions
(b) Desired circular motion
Figures show final configurations of robot using 3 approaches.

.
NPTEL, 2010
62 / 96
S IMULATION R ESULTS
Joint angles for tractrix solution
Joint angles for tractrix solution
100
100
80
80
60
40
Joint 1
Joint 2
Joint 3
Joint 4
Joint 65
20
0
20
40
60
Joint 7
20
Joint 4
Joint 5
Joint 3
Joint 2
Joint 1
40
20
Joint 6
Joint 8
40
60
80
100
0
Joint angle (degrees)
Joint angle (degrees)
60
Joint 7
Joint 8
200
400
600
800
Point in trajectory
1000
1200
80
0
200
400
600
Point in trajectory
800
1000
(c) Plot of joint variables for straight (d) Plot of joint variables for circular
line motions
motion
Joints toward the base move the least.

See references Ravi et al.(2010) for more details and comparison
with other approaches.
.
NPTEL, 2010
63 / 96
E XPERIMENTAL R ESULTS
(e) Straight line motion
(f) Circular motion
Minimising Cartesian motion of links as motion die out

from end-effector to base.
Tractrix based resolution scheme is more natural.
Videos: Pseudo-inverse method, Modal approach, and
Tractrix based approach for straight line trajectory.
Videos: Pseudo-inverse method, Modal approach, and
Tractrix approach circular trajectory.
.
NPTEL, 2010
64 / 96
R EDUNDANT M ANIPULATORS : F REE

M OTION
One end of redundant manipulator is not held fixed

Becomes a snake.
Desired (xp , yp ) provided from a computer and joint
motions computed using tractrix approach.
8-link planar manipulator moves in a snake-like manner.
Motion appears to be natural.
See movie of free motion2 of a hyper-redundant snake
manipulator.
2 See
Module 2, slide # 10 for Known Bugs in viewing

.
. links.
.
NPTEL, 2010
65 / 96
T YING KNOTS , S NAKE MOTION ....
Tractrix based approaches can be extended to spatial

hyper-redundant systems.
Link to videos on single-hand knot tying,
two-hand knot tying and simulated motion of a snake.
Each of the simulation uses a tractrix based approach
(Goel et al., 2010), and motion appears to be more natural.
NPTEL, 2010
66 / 96
S UMMARY
Constrained motion: number of actuated joints less than 6
(in 3D) and less than 3 (in plane).
Redundant serial manipulators Number of actuated joints
greater than 6 (in 3D) and greater than 3 (in a plane)
Inverse kinematics solutions are infinitely many.
Require additional constraints Resolution of redundancy.
Optimisation (minimisation) of joint motion.
Optimsation (minimisation) of Cartesian motion.
Tractrix based approach gives more natural motion.
Simulation and experimental verification of properties of
tractrix based resolution scheme.
NPTEL, 2010
67 / 96
O UTLINE
.
. .1 C ONTENTS
.
. .2 L ECTURE 1
Introduction
.
. .3 L ECTURE 2
.
. .4 L ECTURE 3
.
. .5 L ECTURE 4
.
.
NPTEL, 2010
68 / 96
R EVIEW OF I NVERSE K INEMATICS

Inverse kinematics involves solution of a set of non-linear
transcendental equations.
A closed-form (analytical) solution is desired over a purely
iterative or numerical approach.
Closed-form solutions provide criterion for workspace and
multiple configurations.
General approach for inverse kinematics:
Convert transcendental equations to polynomial equations
using tangent half angle substitution.
Eliminate sequentially (or if possible in one step) joint
variables to arrive at single polynomial in one joint variable.
Solve if possible in closed-form (for polynomials up to
quartic See Korn and Korn, 1968) for the unknown joint
variable.
Obtain other joint variables by back substitution.
Key step is to obtain the univariate polynomial by

elimination.
.
.
.
NPTEL, 2010
69 / 96
E LIMINATION T HEORY
Polynomial equations f (x, y ) = 0 and g (x, y ) = 0 of degree
m and n
Degree of a polynomial is sum of exponents of the highest
degree term.
Example: In polynomial,
f (x, y ) = xy 2 + x 2 y + x 2 + y 2 + 1 = 0, the degree is 3 since
sum of exponent of x and y in first (and second) term is 3.
Bzout Theorem (Semple and Roth, 1949): a maximum of

m n (x, y ) values satisfy both the equations.
Bzout Theorem give upper bound and includes real,
complex conjugate and solutions at infinity.
Example 1: x 2 + y 2 = 1 and y x = 0 are satisfied by two
sets of (x, y ) values ( 12 , 12 ).
Example 2: x 2 + y 2 = 1 and y x = 2 are not satisfied by
any real values of (x, y ).
Example 3: x 2 + y 2 = 1 and y x = 2 satisfied by two

coincident real values of (x, y ).
.
NPTEL, 2010
70 / 96
E LIMINATION T HEORY (C ONTD .)

Example 1, 2 and 3 can also be interpreted geometrically.
Sketch show that line y x = 0 intersects circle
x 2 + y 2 = 1 at two points.
Sketch show that line y x = 2 does not intersects circle
x 2 + y 2 = 1.
Sketch show that line y x = 2 is tangent to circle

x 2 + y 2 = 1.
Verify: Two parabolas, ellipses or hyperbolas (quadratic

curves) can intersect in 4 points.
Apparent contradiction: Two circles never intersect at 4
points.
Contradiction can be resolved if homogeneous coordinates
(see additional material in Module 2) (x, y , w ) is used to
represent equations of circles.
In terms of homogeneous coordinates, there are two
complex conjugate solutions at for any two circles.
.
NPTEL, 2010
71 / 96
E LIMINATION T HEORY (C ONTD .)

Bzout Theorem can be extended to two m and n order
manifolds They intersect in at most a m n order
sub-manifold.
Example 1: A sphere x 2 + y 2 + z 2 = 1 (m = 2) intersects a
plane x = 0 (n = 1) in a circle y 2 + z 2 = 1 A
second-order curve.
Example 2: Two cylinders (m = n = 2) can intersect in a
fourth degree curve.
Bzout theorem is of no use in obtaining the solutions It
is not a constructive theorem.
One constructive method is Sylvesters dialytic elimination
method (Salmon, 1964).
NPTEL, 2010
72 / 96
S YLVESTER S M ETHOD
i
Two polynomials P(x) = m
i=0 ai x = 0 and
n
i
Q(x) = i=0 bi x = 0, ai and bi are co-efficients.
Construct the Sylvesters matrix of P(x) and Q(x)
am am1
...
a1 a0
am am1 ... a1 a0
... ... ...
am ... ... a0
[SM] =
b
b
...
b
b
n
n1
1
0
bn
bn1 ... b1 b0
... ... ...
bn
...
(32)
... b0
Unfilled entries are 0 & [SM] is (m + n) (m + n).

The i th row of the top half are the co-efficients of P(x) x i
for i = n 1, n 2, ..., 1, 0.
The i th row in the bottom half are the co-efficients of
Q(x) x i for i = m 1, m 2, ..., 1, 0.
.
NPTEL, 2010
73 / 96
S YLVESTER S M ETHOD (C ONTD .)

Sylvester criterion3 : P(x) = 0 and Q(x) = 0 have a
non-trivial common factor if and only if det[SM] = 0.
Sylvester criterion from analogy with linear equations.
The n equations P(x) x i = 0, i = n 1, n 2, ..., 1, 0 and
the m equations Q(x) x i for i = m 1, m 2, ..., 1, 0 can
be written as
[SM](x m+n1 , x m+n2 , ...., x 1 , x 0 )T = 0
(33)
Note: all powers of x, x m+n1 , x m+n2 , ..., x 1 , x 0 , including

constant term x 0 treated as linearly independent variables.
Note: the matrix [SM] is square and is of dimension
(m + n) (m + n).
The set of linear equations (33) can have a non-trivial

solution if and only if det[SM] = 0 Same as the
Sylvesters criterion!
3 Sylvester
and Trudi worked in the late 19th century on the theory of

equations, later called the theory of algebraic curves, which forms the
foundation of algebraic geometry.
.
.
.
.
.
NPTEL, 2010
74 / 96
S YLVESTER S M ETHOD (C ONTD .)

Algorithm to solve two polynomials, f (x, y ) = 0 and
g (x, y ) = 0
.1. Rewrite f (x, y ) = 0 and g (x, y ) = 0 as
n
i
i
P(x) = m
i=0 ai (y )x = 0 and Q(x) = i=0 bi (y )x = 0.
Note: all coefficients are function of y or constant.
...
Obtain [SM](y ) and compute det[SM](y ) = 0 A

polynomial in y alone.
...
Solve det[SM](y ) = 0 for all roots analytically (if possible)

or numerically.
...
Linear equations (33) can be solved, using linear algebra

techniques, for the linearly independent unknowns x m+n1 ,
x m+n2 , ..., x 1 , x 0 .
...
The integrity of the numerical procedure can be verified by

checking that x 1 and say x 2 are related by (x 1 )2 = x 2 .
NPTEL, 2010
75 / 96
S YLVESTER S M ETHOD E XAMPLE

Consider two polynomial equations
f1 (x, y ) = a2 (y )x 2 + a1 (y )x + a0 (y ) = 0
f2 (x, y ) = b2 (y )x 2 + b1 (y )x + b0 (y ) = 0
(34)
ai , bi , i = 0, 1, 2 are arbitrary polynomials in y or constants.

Sylvesters matrix given by
a2
0
[SM] =
b2
0
a1
a2
b1
b2
a0 0
a1 a0
b0 0
b1 b0
(35)
det[SM](y ) = 0 reduces to
(a2 b1 b2 a1 )(a1 b0 b1 a0 ) (a2 b0 b2 a0 )2 = 0.
.
NPTEL, 2010
76 / 96
S YLVESTER S M ETHOD E XAMPLE

The variable x can
equations
a2
0
b2
0
be obtained from the set of linear

a1
a2
b1
b2
as
x = x1 =
3
a0 0
x
x2
a1 a0
b0 0 x 1
b1 b0
x0
=0
(36)
a1 b0 b1 a0 a2 b0 b2 a0
=
a2 b0 b2 a0 a1 b2 a2 b1
(37)
Note: x computed using the two expressions on the

right-hand side must be same and can be used as a
programming/numerical consistency check.
1 a0
Note: aa12 bb00 b
b2 a0 =
a2 b0 b2 a0
a1 b2 a2 b1
is same as det[SM](y ) = 0!
.
NPTEL, 2010
77 / 96
B ZOUTS M ATRIX
det[SM] is also called the resultant of P(x) and Q(x) and
is denoted by res(P, Q).
[SM] is (m + n) (m + n) and res(P, Q) can become
computationally expensive.
Bzout in the 18th century proposed a method where
res(P, Q) can be computed as a determinant of order
max(m, n).
The key idea is to divide instead of multiplying to get
required number of independent equations and a square
matrix.
Although dimension of matrix is less, each element of the
matrix is more complex.
NPTEL, 2010
78 / 96
B ZOUTS M ATRIX (C ONTD .)

n
i
i
Consider P(x) = m
i=0 ai x = 0 and Q(x) = i=0 bi x = 0
with m > n.
For x = 0, eliminate x m from P(x) = 0 and x mn Q(x) = 0
by writing
am
am1 x m1 + .... + a0
=
bn
bn1 x m1 + ... + b0 x mn
to get
(am1 bn am bn1 )x m1 +(am2 bn am bn2 )x m2 +....+a0 bn = 0

(38)
Also eliminate x m by writing
am x + am1
am2 x m2 + .... + a0
=
bn x + bn1
bn2 x m2 + ... + b0 x mn
to get
(am2 bn bn2 am )x m1 +
[(am3 bn bn3 am ) + (am2 bn1 bn2 am1 )]x m2
+... + a0 bn1 = 0
(39)
.
NPTEL, 2010
79 / 96
Repeat to obtain n equations with the nth equation given

by
(amn bn am b0 )x m1 + (amn1 bn + amn bn1 am1 b0 )x m2
(40)
+.... + a0 b1 = 0
Construct m n equations
x mn1 Q(x) = bn x m1 + bn1 x m2 + ... + b0 x mn1
x
mn2
mn2
.....
0(41)
Q(x) = bn x + ... + b0
Q(x) = bn x
m2
+ ... + b0 x
n
NPTEL, 2010
80 / 96

The Bzout matrix is given as
am1 bn am bn1
...
amn bn am b0
bn
am2 bn am bn2
...
amn1 bn + amn bn1 am1 b0
bn1
bn
...
..
..
..
b0
..
..
..
a 0 bn
..
a0 b1
..
..
..
b0
..
...
..
b0
(42)
where the unfilled entries are 0s.

Criterion for non-trivial common factor: det[BM] = 0.
If m = n, then in equations (38) - (40), a set of n linearly
independent equations in n unknowns x n1 , ...., x 0 are
already available.
Solve for the unknowns by standard linear algebra
techniques.
.
NPTEL, 2010
81 / 96
B ZOUTS M ATRIX - I LLUSTRATION
Consider two cubics of the form

a3 x 3 + a2 x 2 + a1 x + a0 = 0
b3 x 3 + b2 x 2 + b1 x + b0 = 0
(43)
The Bzout matrix is given by
b3 a2 a3 b2
[BM] = b3 a1 a3 b1
b3 a0 a0 b3
b3 a 0 a 3 b0
b2 a0 a2 b0
b1 a0 a1 b0
(44)
b3 a 1 a 3 b1
(b3 a0 a3 b0 ) + (b2 a1 a2 b1 )
b2 a 0 a 2 b0
Note: [BM] is 3 3 while [SM] would be 6 6 for this case.
NPTEL, 2010
82 / 96
E QUIVALENCE OF [BM] AND [SM]

Intuitively, Bzout matrix and Sylvester matrix should be
related as no new information is contained!
Example: Consider P(x) = a3 x 3 + a2 x 2 + a1 x + a0 = 0 and
Q(x) = b2 x 2 + b1 x + b0 = 0.
Sylvesters matrix is given by
a3 a2 a1 a0 0
0 a3 a2 a1 a0
(45)
[SM] =
b2 b1 b0 0 0
0 b2 b1 b0 0
0 0 b2 b1 b0
The Bzout matrix is given as
a1 b2 a3 b0 a0 b2 + a1 b1 a2 b0 a0 b1
a1 b2 a3 b0
a0 b2 (46)
[BM] = a2 b2 a3 b1
b2
b1
b0
.
NPTEL, 2010
83 / 96
E QUIVALENCE OF [BM] AND [SM] C ONTD .

Pre-multiply [SM] by matrix
1 0
0
0
0 1
0
0
b
b
a
a
[A] =
2
1
3
2
0 b2
0
a3
0 0
0
0
to get
[B] =
a3
0
0
0
0
a2
a3
0
0
0
a1
a2
a1 b2 a3 b0
a2 b2 a3 b1
b2
0
0
0
0
1
a0
a1
a0 b2 + a1 b1 a2 b0
a 1 b2 a 3 b0
b1
(47)
0
a0
a0 b1
a0 b2
b0
(48)
det[A] det[SM] = (a3 )2 det[SM] = det[B] = (a3 )2 det[BM]

which shows that det[SM] = det[BM].
.
NPTEL, 2010
84 / 96
O UTLINE
.
. .1 C ONTENTS
.
. .2 L ECTURE 1
Introduction
.
. .3 L ECTURE 2
.
. .4 L ECTURE 3
.
. .5 L ECTURE 4
.
.
NPTEL, 2010
85 / 96
IK OF G ENERAL 6R ROBOT
General 6R robot: no constant D-H link parameters have
special values, such as 0, /2, or .
Special D-H values (PUMA 560) result in easier
elimination.
If prismatic joint is present Elimination is easier.
Inverse kinematics of general 6R unsolved for a long time.
Several researchers worked on problem Duffy and Crane
(1980) first derived a 32nd order polynomial in one joint
angle.
Eventually Raghavan and Roth (1993) derived a 16th
degree polynomial in one joint angle.
Follow the development in Raghavan and Roth (1993) &

extensive use elimination theory discussed in Lecture 3.
Direct kinematics for general 6R manipulator
0
6 [T ]
= 01 [T ]12 [T ]23 [T ]34 [T ]45 [T ]56 [T ]

.
(49)
.
NPTEL, 2010
86 / 96
Recall with respect to equation (49)
i 1
[T ]
i
is a function of only one joint variable i and three

D-H parameters which are constants.
For IK problem, 06 [T ] is given Find the six joint variables
in each of ii 1 [T ], i = 1, 2, ..., 6.
Step 1: write i1
i [T ] as product of two matrices
(ii1 [T ])st (i1
[T
])jt .
i
i1
[T ] = (ii 1 [T ])st (i1
[T ])jt
i
i
1
0
0
0
0
ci 1
si 1
0
0
si 1
ci 1
0
ai 1
ci
s
0
i
0 0
1
0
si
ci
0
0
0
0
1
0
0
0
(50)
di
1
Matrix (i1
i [T ])st is constant.
Matrix (i1
i [T ])jt is a function of the joint variable i (for a
rotary joint) or di (for a prismatic joint).
.
NPTEL, 2010
87 / 96
Step 2: Reorganize equation of direct kinematics
Rewrite equation (49) as
(23 [T ])jt 34 [T ]45 [T ](56 [T ])st =
1
1 0
1 0
5
1
(23 [T ])1
(51)
st (2 [T ]) (1 [T ])
6 [T ](6 [T ])jt
The left-hand side is only a function of (3 , 4 , 5 ).

The right-hand side is only a function of (1 , 2 , 6 ).
Six scalar equations obtained by equating the top three
elements of columns 3 and 4 on both sides of
equation (51) do not contain 6 .
[A](s4 s5 s4 c5 c4 s5 c4 c5 s4 c4 s5 c5 1)T
= [B](s1 s2 s1 c2 c1 s2 c1 c2 s1 c1 s2 c2 )T
[A] is 6 9 with elements linear in s3 , c3 , 1, and [B] is
6 8 matrix of constants.
Denote columns 3 and 4 by p and l.
.
(52)
NPTEL, 2010
88 / 96
Step 3: Eliminate four of five i , i = 1, .., 5 in equation (52).
Key step is to obtain minimal set of equations.
Minimal set of equations is 14 (Raghavan & Roth, 1993)
Three equations from p,
Three equations from l,
One scalar equation from the scalar dot product p p,
One scalar equation from the scalar dot product p l,
Three equations from the vector cross product p l, and
Three scalar equations from (p p)l (2p l)p.
The 14 equations can be written as

[P] (s4 s5 s4 c5 c4 s5 c4 c5 s4 c4 s5 c5 1)T
= [Q] (s1 s2 s1 c2 c1 s2 c1 c2 s1 c1 s2 c2 )T
(53)
[P] is a 14 9 matrix whose elements are linear in c3 , s3 , 1,

and [Q] is a 14 8 matrix of constants.
.
NPTEL, 2010
89 / 96
Step 3: Elimination of four i (Contd.)
First use any eight of the 14 equations in equation (53) and
solve for the eight variables s1 s2 , s1 c2 , c1 s2 , c1 c2 , s1 , c1 , s2 , c2 .
Always possible to solve eight linear equations in eight
unknowns.
Substitute the eight variables in the rest of the six
equations to get
[R] (s4 s5 s4 c5 c4 s5 c4 c5 s4 c4 s5 c5 1)T = 0
(54)
[R] is a 6 9 matrix whose elements are linear in s3 and c3 .
NPTEL, 2010
90 / 96
Step 4: Elimination of 4 and 5
Use tangent half-angle formulas for s3 , c3 , s4 , c4 , s5 , and
c5 .
On simplifying get
(
)T
[S] x42 x52 x42 x5 x42 x4 x52 x4 x5 x4 x52 x5 1 = 0
(55)
where [S] is a 6 9 matrix and x() = tan( 2 ).

Eliminate x4 and x5 using Sylvesters dialytic method.
Six additional equations are generated by multiplying
equations in equation (55) by x4 .
Three additional linearly independent variables, namely,
x43 x52 , x43 x5 , and x43 , are generated.
A system of 12 equations in 12 unknowns.
.
NPTEL, 2010
91 / 96
Step 4: Elimination of 4 and 5 (Contd.)
The 12 equations can be
written as
x43 x52
x 3x
4 5
x3
4
x 2x 2
4 5
x 2x
5
)
(
4
S 0 x42
=0
2
0 S x4 x5
x4 x5
x4
2
x5
x5
1
(56)
Following Sylvesters
method,
set )
(
S 0
=0
det
0 S
On simplification, a
16th-degree polynomial in
x3 is obtained.
Solve for roots of this
polynomial and find
3 = 2 tan1 (x3 ).
NPTEL, 2010
92 / 96
Step 5: Obtain other joint angles
Once 3 is known, find x4 and x5 from equation (56) using
standard linear algebra.
From x4 and x5 find 4 and 5 .
Once 3 , 4 , and 5 are known, solve s1 s2 , s1 c2 , ..., s2 , c2
from eight linearly independent equations (53).
Obtain unique 1 and 2 .
To obtain 6 , rewrite equation (49) as
5
6 [T ]
= 45 [T ]
1 3
1 2
1 1
1 0
1 0
4 [T ] 3 [T ] 2 [T ] 1 [T ] 6 [T ]
(57)
i , i = 1, 2, ..., 5 are known (1, 1) and (2, 1) elements

gives two equations in s6 and c6 Unique value of 6 .
.
NPTEL, 2010
93 / 96
IK OF 6R ROBOT: S UMMARY
A sixteenth degree polynomial in x3 is obtained in Step 4
General 6R serial manipulator has 16 possible solutions.
A 6R manipulator with special geometry Polynomial in
x3 can be of lower order.
If one or more joints are prismatic IK is simpler since
prismatic joint variable is not in terms of sines or cosines.
No general expression for workspace boundary
Closed-form solution for 16th-degree polynomial not
possible!
Check: If all the roots of the 16th-degree polynomial are
complex, then 06 [T ] is not in the workspace of the
manipulator.
All the inverse kinematics solutions & entire workspace may
not be available due to the presence of joint limits and
limitations of hardware (see, Rastegar and Deravi, 1987 &
Dwarakanath et al. 1992).
.
NPTEL, 2010
94 / 96
O UTLINE
.
. .1 C ONTENTS
.
. .2 L ECTURE 1
Introduction
.
. .3 L ECTURE 2
.
. .4 L ECTURE 3
.
. .5 L ECTURE 4
.
.
NPTEL, 2010
95 / 96
A DDITIONAL M ATERIAL
Exercise Problems
References & Suggested Reading
To view above links

Copy link and paste in a New Window/Tab by right click.
Close new Window/Tab after viewing.
NPTEL, 2010
96 / 96

R: A C & A: Obotics Dvanced Oncepts

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

R: A C & A: Obotics Dvanced Oncepts

Uploaded by

Copyright:

Available Formats

ROBOTICS : A DVANCED C ONCEPTS

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

Serial manipulators: One end fixed Links and joints

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

E XAMPLES OF S ERIAL ROBOTS

(a) 3 DOF planar

(b) Six DOF

(c) Six DOF T3

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

D EGREES OF F REEDOM (DOF)

N Total number of links including the fixed link (or base),

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

D EGREES OF F REEDOM (C ONTD .)

DOF = End-effector can be positioned and oriented

Serial manipulators with a fixed base, a free end-effector

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

Actuator space: due to mechanical linkages, gears, etc.

Manipulator/robot kinematics Functional relationship

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

Inverse Kinematics Problem:

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

D IRECT K INEMATICS P ROBLEM

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

D IRECT K INEMATICS P ROBLEM

Figure 1: The planar 3R manipulator

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

Example 2 A SCARA manipulator

Figure 2: A SCARA manipulator

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

D IRECT K INEMATICS P ROBLEM

c1 {c23 (c4 c5 c6 s4 s6 ) s23 s5 c6 } + s1 (s4 c5 c6 + c4 s6 )

Direct kinematics: Given D-H parameters, find position and

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

Following cases possible:

n = 6 for 3D motion or n = 3 for planar motion Same

Start with the simplest case of planar 3R manipulator.

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

Inverse Kinematics: Given

Figure 3: The planar 3R manipulator

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

I NVERSE K INEMATICS A LGORITHM

where k2 = l2 s2 and k1 = l1 + l2 c2 . Note: atan2(y , x) is the

A SHITAVA G HOSAL (IIS C )

ROBOTICS : A DVANCED C ONCEPTS & A NALYSIS

Figure 4 shows the region