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 条
  • [41] A recursive algorithm for an efficient and accurate computation of incomplete Bessel functions
    Slevinsky, Richard M.
    Safouhi, Hassan
    NUMERICAL ALGORITHMS, 2023, 92 (01) : 973 - 983
  • [42] Recursive reordering and elimination method for efficient computation of PageRank problems
    Shen, Zhao-Li
    Liu, Yu -Tong
    Carpentieri, Bruno
    Wen, Chun
    Wang, Jian-Jun
    AIMS MATHEMATICS, 2023, 8 (10): : 25104 - 25130
  • [43] Pulse-order recursive method for inverse covariance matrix computation applied to space-time adaptive processing
    YANG XiaoPeng
    LIU YongXu
    LONG Teng
    ScienceChina(InformationSciences), 2013, 56 (04) : 123 - 134
  • [44] Pulse-order recursive method for inverse covariance matrix computation applied to space-time adaptive processing
    XiaoPeng Yang
    YongXu Liu
    Teng Long
    Science China Information Sciences, 2013, 56 : 1 - 12
  • [45] O(n log(2)n) determinant computation of a Toeplitz matrix and fast variance estimation
    Dietrich, CR
    Osborne, MR
    APPLIED MATHEMATICS LETTERS, 1996, 9 (02) : 29 - 31
  • [46] Efficient distance computation in configuration space
    Zhang, Liangjun
    Kim, Young J.
    Manocha, Dinesh
    COMPUTER AIDED GEOMETRIC DESIGN, 2008, 25 (07) : 489 - 502
  • [47] Efficient Computation of Geodesics in Color Space
    Bujack, Roxana
    Caffrey, Elektra
    Teti, Emily
    Turton, Terece L.
    Rogers, David H.
    Miller, Jonah
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2024, 30 (09) : 6507 - 6519
  • [48] Pulse-order recursive method for inverse covariance matrix computation applied to space-time adaptive processing
    Yang XiaoPeng
    Liu YongXu
    Long Teng
    SCIENCE CHINA-INFORMATION SCIENCES, 2013, 56 (04) : 1 - 12
  • [49] RECURSIVE COMPUTATIONAL ALGORITHM FOR THE GENERALIZED BLOCK-PULSE OPERATIONAL MATRIX
    WANG, CH
    MARLEAU, RS
    INTERNATIONAL JOURNAL OF CONTROL, 1987, 45 (01) : 195 - 201
  • [50] Bandwidth of WK-recursive networks and its sparse matrix computation
    Nathiya, R.
    Meiyappan, D.
    Prabhu, Savari
    Stephen, Sudeep
    JOURNAL OF SUPERCOMPUTING, 2025, 81 (01):