首页 /研究 /Efficient O(N) computation of the operational space inertia matrix
MANIPULATION

Efficient O(N) computation of the operational space inertia matrix

Kathryn W. Lilly, David E. Orin

发表年份
2002
引用次数
19

摘要

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>or=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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

关键词

Recursion (computer science)InertiaBase (topology)ComputationMatrix (chemical analysis)AlgorithmSylvester's law of inertiaComputer scienceSpace (punctuation)Theoretical computer science

相关论文

查看 MANIPULATION 分类全部论文