EFFICIENT O(N) RECURSIVE COMPUTATION OF THE OPERATIONAL SPACE INERTIA MATRIX

被引:13
|
作者
LILLY, KW [1 ]
ORIN, DE [1 ]
机构
[1] OHIO STATE UNIV, DEPT ELECT ENGN, COLUMBUS, OH 43210 USA
来源
基金
美国国家科学基金会;
关键词
D O I
10.1109/21.260669
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The operational space inertia matrix A reflects the dynamic properties of a robot manipulator to its tip. In the control domain, it may be used to decouple force and/or motion control about the manipulator workspace axes. The matrix A also plays an important role in the development of efficient algorithms for the dynamic simulation of closed-chain robotic mechanisms, including simple closed-chain mechanisms such as multiple manipulator systems and walking machines. The traditional approach used to compute A has a computational complexity of O(N3) for an N degree-of-freedom manipulator. This paper presents the development of a recursive algorithm for computing the operational space inertia matrix (OSIM) that reduces the computational complexity to O(N). This algorithm, the inertia propagation method, is based on a single recursion that begins at the base of the manipulator and progresses out to the last link. Also applicable to redundant systems and mechanisms with multiple-degree-of-freedom joints, the inertia propagation method is the most efficient method known for computing A for N greater-than-or-equal-to 6. The numerical accuracy of the algorithm is discussed for a PUMA 560 robot with a fixed base.
引用
收藏
页码:1384 / 1391
页数:8
相关论文
共 50 条
  • [31] An efficient computation of generalized inverse of a matrix
    Pan, V. Y.
    Soleymani, F.
    Zhao, L.
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 316 : 89 - 101
  • [32] Exploiting Matrix Dependency for Efficient Distributed Matrix Computation
    Yu, Lele
    Shao, Yingxia
    Cui, Bin
    SIGMOD'15: PROCEEDINGS OF THE 2015 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2015, : 93 - 105
  • [33] EFFICIENT COMPUTATION OF MATRIX CHAIN PRODUCTS
    GODBOLE, SS
    IEEE TRANSACTIONS ON COMPUTERS, 1973, C 22 (09) : 864 - 866
  • [34] Efficient Computation of Covariance Matrix Entries
    Lin, Yuzhang
    Abur, Ali
    2015 NORTH AMERICAN POWER SYMPOSIUM (NAPS), 2015,
  • [35] Efficient computation of the permanent of a sparse matrix
    Mittal, RC
    Al-Kurdi, A
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2001, 77 (02) : 189 - 199
  • [36] An efficient threshold choice for the computation of operational risk capital
    Guegan, Dominique
    Hassani, Bertrand K.
    Naud, Cedric
    JOURNAL OF OPERATIONAL RISK, 2011, 6 (04): : 3 - 19
  • [37] Efficient recursive computation of molecular integrals for density functional methods
    Koster, AM
    JOURNAL OF CHEMICAL PHYSICS, 1996, 104 (11): : 4114 - 4124
  • [38] Efficient computation of recursive principal component analysis for structured input
    Sperduti, Alessandro
    MACHINE LEARNING: ECML 2007, PROCEEDINGS, 2007, 4701 : 335 - 346
  • [39] A recursive algorithm for an efficient and accurate computation of incomplete Bessel functions
    Richard M. Slevinsky
    Hassan Safouhi
    Numerical Algorithms, 2023, 92 : 973 - 983
  • [40] An Efficient and Fast Algorithm for Realizing Recursive MDCT and IMDCT Computation
    Ren, Yueqi
    Li, Hui
    INTERNATIONAL CONFERENCE ON ELECTRICAL, CONTROL AND AUTOMATION (ICECA 2014), 2014, : 454 - 462