4 MANIPULATOR RIGID-BODY DYNAMICS
20
Method Multiplications Additions For N=6
Multiply Add
Lagrangian[22] 32
1
2
n
4
+ 86
5
12
n
3
25n
4
+ 66
1
3
n
3
66,271 51,548
+171
1
4
n
2
+ 53
1
3
n
+129
1
2
n
2
+ 42
1
3
n
−128 −96
Recursive NE[22] 150n− 48 131n−48 852 738
Kane[13] 646 394
Simplified RNE[25] 224 174
Table 1: Comparison of computational costs for inverse dynamics from various sources.
The last entry is achieved by symbolic simplification using the software package ARM.
Orin et al.[19] proposed an alternative approach based on the Newton-Euler (NE) equations
of rigid-body motion applied to each link. Armstrong[20] then showed how recursion might
be applied resulting in O(n) complexity. Luh et al.[21] provided a recursive formulation of
the Newton-Euler equations with linear and angular velocities referred to link coordinate
frames. They suggested a time improvement from 7.9s for the Lagrangian formulation
to 4.5ms, and thus it became practical to implement ‘on-line’. Hollerbach[22] showed
how recursion could be applied to the Lagrangian form, and reduced the computation to
within a factor of 3 of the recursive NE. Silver[23] showed the equivalence of the recursive
Lagrangian and Newton-Euler forms, and that the difference in efficiency is due to the
representation of angular velocity.
“Kane’s equations” [13] provide another methodology for deriving the equations of motion
for a specific manipulator. A number of ‘Z’ variables are introduced, which while not
necessarily of physical significance, lead to a dynamics formulation with low computational
burden. Wampler[24] discusses the computational costs of Kane’s method in some detail.
The NE and Lagrange forms can be written generally in terms of the Denavit-Hartenberg
parameters — however the specific formulations, such as Kane’s, can have lower compu-
tational cost for the specific manipulator. Whilst the recursive forms are computationally
more efficient, the non-recursive forms compute the individual dynamic terms (M, C and
G) directly. A comparison of computation costs is given in Table 1.
4.1 Recursive Newton-Euler formulation
The recursive Newton-Euler (RNE) formulation[21] computes the inverse manipulator dy-
namics, that is, the joint torques required for a given set of joint angles, velocities and
accelerations. The forward recursion propagates kinematic information — such as angu-
lar velocities, angular accelerations, linear accelerations — from the base reference frame
(inertial frame) to the end-effector. The backward recursion propagates the forces and mo-
ments exerted on each link from the end-effector of the manipulator to the base reference
frame
3
. Figure 9 shows the variables involved in the computation for one link.
The notation of Hollerbach[22] and Walker and Orin [26] will be used in which the left
superscript indicates the reference coordinate frame for the variable. The notation of Luh et
al.[21] and later Lee[7, 2] is considerably less clear.
3
It should be noted that using MDH notation with its different axis assignment conventions the Newton Euler
formulation is expressed differently[8].