Parallel algorithms for computation of the manipulator inertia matrix

Journal Article · Mon Apr 01 00:00:00 EST 1991 · International Journal of Robotics Research; (United States)

DOI:https://doi.org/10.1177/027836499101000207· OSTI ID:5630005

Amin-Javaheri, M ^[1]; Orin, D E ^[2]

---

1. GMF Robotics Corp., Auburn Hills, MI (United States)
2. Ohio State Univ., Columbus (United States)

This article presents the development of an O(log{sub 2} N) parallel algorithm for the manipulator inertia matrix. It is based on an efficient serial algorithm that uses the composite rigid-body method. Recursive doubling is used to reformulate the linear recurrence equations that are required to compute the diagonal elements of the matrix. It results in O(log{sub 2} N) levels of computation. Computation of the off-diagonal elements involves N linear recurrences of varying size, and a new method, which avoids redundant computation of position and orientation transforms for the manipulator, is developed. The O(log{sub 2} N) algorithm is presented in both equation and graphic forms that clearly show the parallelism inherent in the algorithm. The relationship between the number of processors required and the order of the computation is also given for several versions of parallel algorithms for the inertia matrix.

• OSTI ID: 5630005
• Journal Information: International Journal of Robotics Research; (United States), Vol. 10:2; ISSN 0278-3649
• Country of Publication: United States
• Language: English

Related Subjects

42 ENGINEERING
ROBOTS
ALGORITHMS
RESEARCH PROGRAMS
CALCULATION METHODS
EFFICIENCY
MATHEMATICAL MODELS
MATRICES
PARALLEL PROCESSING
MATHEMATICAL LOGIC
PROGRAMMING
420200* - Engineering- Facilities
Equipment
& Techniques