Closure conditions for spatial mechanisms: a non-recursive formulation

被引:0
|
作者
J. Wittenburg
机构
[1] Institute of Technical Mechanics,
[2] University of Karlsruhe,undefined
[3] D-76128 Karlsruhe e-mail: wittenburg@itm.uni-karlsruhe.de,undefined
来源
关键词
Keywords Closure conditions, Mechanism theory, Serial robots, Inverse kinematics, Principle of transference;
D O I
暂无
中图分类号
学科分类号
摘要
 In closed spatial single-degree-of-freedom mechanisms six dependent joint variables must be expressed in terms of a single independent variable. The same problem arises when six joint variables of a serial robot must be expressed in terms of six independent coordinates describing the position and the angular orientation of the robot hand relative to the robot base. Such kinematics analyses start out from closure conditions. There are systematic ways of formulating closure conditions, e.g. in terms of scalar products of body-fixed vectors. In the existing literature considerable labour is devoted to the conversion of such vector equations into scalar equations in terms of Denavit–Hartenberg parameters. In one way or other, two-step recursive procedures are used which require lengthy and sometimes non-obvious formula manipulations. In the present paper a straight-forward non-recursive procedure is presented which is applicable to arbitrary spatial mechanisms. Its efficiency is illustrated by applications to the mechanisms RRSRR, 5R-2P, 4R-3P and 7R.
引用
收藏
页码:933 / 948
页数:15
相关论文
共 50 条
  • [1] Closure conditions for spatial mechanisms: a non-recursive formulation
    Wittenburg, J
    ARCHIVE OF APPLIED MECHANICS, 2003, 72 (11-12) : 933 - 948
  • [2] THE NON-RECURSIVE NEWTON-EULER FORMULATION OF THE DYNAMIC EQUATION FOR ROBOTIC MECHANISMS
    LI, YS
    KESSARIS, A
    TRANSACTIONS OF THE CANADIAN SOCIETY FOR MECHANICAL ENGINEERING, 1986, 10 (01) : 16 - 20
  • [3] NON-RECURSIVE RECURSION
    CARPENTER, BE
    DORAN, RW
    HOPPER, K
    SOFTWARE-PRACTICE & EXPERIENCE, 1977, 7 (02): : 263 - 269
  • [4] NON-RECURSIVE TREE SORT
    WOODALL, AD
    COMPUTER JOURNAL, 1971, 14 (01): : 104 - &
  • [5] CONVERTING A CLASS OF RECURSIVE PROCEDURES INTO NON-RECURSIVE ONES
    ROHL, JS
    SOFTWARE-PRACTICE & EXPERIENCE, 1977, 7 (02): : 231 - 238
  • [6] A new approach on recursive and non-recursive SIR methods
    Bercu, Bernard
    Thi Mong Ngoc Nguyen
    Saracco, Jerome
    JOURNAL OF THE KOREAN STATISTICAL SOCIETY, 2012, 41 (01) : 17 - 36
  • [7] RECURSIVE AND NON-RECURSIVE NETWORK CODING: PERFORMANCE AND COMPLEXITY
    Thibault, Jean-Pierre
    Chan, Wai-Yip
    Yousefi, Shahram
    ICSPC: 2007 IEEE INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATIONS, VOLS 1-3, PROCEEDINGS, 2007, : 1223 - 1226
  • [8] A new approach on recursive and non-recursive SIR methods
    Bernard Bercu
    Thi Mong Ngoc Nguyen
    Jérôme Saracco
    Journal of the Korean Statistical Society, 2012, 41 : 17 - 36
  • [9] Non-recursive freeness and non-rigidity
    Abe, T.
    Cuntz, M.
    Kawanoue, H.
    Nozawa, T.
    DISCRETE MATHEMATICS, 2016, 339 (05) : 1430 - 1449
  • [10] NON-RECURSIVE GRAPH CONVOLUTIONAL NETWORKS
    Chen, Hao
    Deng, Zengde
    Xu, Yue
    Li, Zhoujun
    2021 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP 2021), 2021, : 3205 - 3209