DocumentCode
2512562
Title
Efficient O (N ) computation of the operational space inertia matrix
Author
Lilly, Kathryn W. ; Orin, David E.
Author_Institution
Dept. of Electr. Eng., Ohio State Univ., Columbus, OH, USA
fYear
1990
fDate
13-18 May 1990
Firstpage
1014
Abstract
The development of a recursive algorithm for the operational space inertia matrix, the inertia propagation method, which reduces the computational complexity to O (N ) for any manipulator is presented. The algorithm is based on a single recursion which begins at the base of the manipulator and progresses out to the last link. Spatial articulated transformations are utilized in the recursion procedure. The algorithm is the most efficient method known for N ⩾6. The numerical accuracy of the algorithm is tested for a PUMA 560 robot with a fixed base. The results demonstrate the accuracy of the inertia propagation method for such a configuration
Keywords
computational complexity; matrix algebra; robots; O(N) computation; computational complexity; inertia propagation method; operational space inertia matrix; recursive algorithm; Acceleration; Computational complexity; Computational modeling; End effectors; Equations; Heuristic algorithms; Manipulator dynamics; Motion control; Orbital robotics; Robot kinematics;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Automation, 1990. Proceedings., 1990 IEEE International Conference on
Conference_Location
Cincinnati, OH
Print_ISBN
0-8186-9061-5
Type
conf
DOI
10.1109/ROBOT.1990.126125
Filename
126125
Link To Document