By Topic

Parallel O(log N) algorithms for computation of manipulator forward dynamics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. Fijany ; Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA ; I. Sharf ; G. M. T. D'Eleuterio

These parallel algorithms described are based on a new O(N) solution to the problem. The underlying feature of this O(N) method is a different strategy for decomposition of interbody force which results in a new factorization of mass matrix (M). Specifically, a factorization of inverse of the mass matrix in the form of Schur complement is derived as M-1=C-DtA-1B wherein A, B, and C are block tridiagonal matrices. The new O(N) algorithm is then derived as a recursive implementation of this factorization of M-1. It is shown that the resulting algorithm is strictly parallel. Strategies for multilevel exploitation of parallelism in the computation are also discussed, resulting in more efficient parallel O(log N) algorithms. The parallel algorithms developed in this paper, in addition to their theoretical significance, are also important from a practical implementation standpoint due to their simple architectural requirements

Published in:

IEEE Transactions on Robotics and Automation  (Volume:11 ,  Issue: 3 )