Inertia Propagation Method

The two tables differ only in the algorithm used to compute the inverse operational space inertia matrix, A and the coefficient fl. In Chapter 4, the efficient computation of these two quantities was discussed in some detail. It was detomined that the Unit Force Method (Method II) is the most efficient algorithm for these two matrices together for N < 21. The Force Propagation Method (Method ni) is the best solution for and fl for AT > 21. The scalar opmtions required for Method II are used in Table 5.1, while those required for Method III are used in Table 5.2. 

Brandi, Johanni, and Otter [3] computes the articulated-body inertia of each link in the chain, starting at the tip and moving back to the base. This same recursion is the first recursion in the Force Propagation Method for computing A. That is, there is an overlap of computations between the solution for the q)en-chain acceleration terms, tjopen and Xopen. and the calculation of the inverse ( rational space inertia matrix, A for this case. This fact was taken into account when the operations were tabulated. The ( rations listed for SI and A in Table 5.2 include only the second recursion for A and the additional opoations needed for SI. The recursion which computes the articulated-body inertias is included in the computatimis for open and x<,pe . 

In this simple recursion, the operational space inertia matrix of the base member, Ao, is propagated across joint 1 by La > a new spatial articulated transformation which is very similar in form to the acceloation propagator of the previous section. The propagated matrix is combined with Ii, the spatial inertia of link 1 to form Ai, the operational space inertia matrix of the two-link partial chain comprised of links 0 and 1. Note the similarity between this recursive procedure and the structural recursion used to derive the Structurally Recursive Method (Method I) in Ch t 3. 

---