App 8
App 8
In this appendix, we develop a method to compute efficiently the inertia matrix of tree
structured robots. Note that a serial robot is a special case of the tree structured robot. This
method is based on the utilization of a simplified special case of Newton-Euler algorithm and
on the concept of composite links [Khalil 90b].
The composite link j"** is composed of link j and of the links supported by link j (Figure
A8.1). The inertial parameters of the composite link j"^ can be calculated in terms of the
standard parameters (or base parameters) of its links using the following recursive algorithm:
+ »(J)Pj«(J)pjMj* (A8.1al
432 Modeling, identification and control of robots
with:
- »0)MSJ^ = »(J)AjiMsJ';
- v: (3x3) skew-symmetric matrix of the components of the vector v;
aO)Aj «(J)Pj
- aO)Tj =
L 03,1 '
- JJj: inertia tensor of the composite link j * referred to frame RJ;
- JMS::firstmoments of the composite link j"** referred to frame RJ;
- M:: mass of the composite link j"*".
where
NOTE.-^^^Xj
TheandJKj are defined
relationship in Chapters
between 9 and
the concept 10 and Appendix
of composite 7.
link parameters and base inertia!
parameters is considered in [Khalil 90a].
We have seen in § 9.7.1 that the j^** column of the inertia matrix A can be computed by
the Newton-Euler inverse dynamic algorithm by setting:
where Uj is an (nxl) vector with a 1 in the j^** row and zeros elsewhere.
Under these conditions, the forward recursive equations of the Newton-Euler inverse
dynamic (Chapter 9) are only applied to link j"*":
We deduce that:
- if joint j is prismatic (icbj« 0, JMj« 0 and J Vj = [ 0 0 I ] \ then:
The recursive backward computation starts by link j and ends with link s» where a(s) = 0.
The algorithm is given by the following equations:
- if joint j is prismatic, then:
iiT
Jnij = JMj = [MYj -MXj 01' [A8.14]
,+ +Iaj
Ajj = Mj [A8.15]
Then, the following equations are computed for k=:j. a(j), a(a(j),..., s. where a(s)=0:
NOTES-
- the element Aj j of the inertia matrix is set to zero if link i does not belong to the path
between the base and link j ;
- this algorithm provides the elements of the lower part of the inertia matrix. The other
elements are deduced using the fact that the inertia matrix A is symmetric.