北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2019, Vol. 42 ›› Issue (1): 102-108.doi: 10.13190/j.jbupt.2018-142

• 研究报告 • 上一篇    下一篇

三分支机器人最小范数逆解算法

洪磊1, 王保升2, 陈钢3   

  1. 1. 南京工程学院 汽车与轨道交通学院, 南京 211167;
    2. 南京工程学院 智能装备产业技术研究院, 南京 211167;
    3. 北京邮电大学 自动化学院, 北京 100876
  • 收稿日期:2018-07-01 出版日期:2019-02-28 发布日期:2019-03-08
  • 作者简介:洪磊(1982-),男,副教授,E-mail:njithl@163.com.
  • 基金资助:
    国家自然科学基金项目(61703200);江苏省"青蓝工程"基金项目

Algorithm for Least-Norm Inverse Kinematic Solution of Trinal-Branch Robotic Manipulator

HONG Lei1, WANG Bao-sheng2, CHEN Gang3   

  1. 1. School of Automotive and Rail Transit, Nanjing Institute of Technology, Nanjing 211167, China;
    2. Industrial Technology Research Institute of Intelligent Equipment, Nanjing Institute of Technology, Nanjing 211167, China;
    3. School of Automation, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2018-07-01 Online:2019-02-28 Published:2019-03-08
  • Supported by:
     

摘要: 基于线性方程组及条件极值理论,针对三分支机器人逆运动学问题,提出了一种改进的最小范数逆解算法,避免了传统最小范数逆解中雅可比矩阵广义逆的复杂计算.针对操作分支关节数不小于任务空间维数的情况,进一步利用施密特正交化过程进行简化,提高了运算的实时性.搬运物体的仿真实例结果验证了所提算法的有效性.

关键词: 三分支, 最小范数, 运动学逆解, 施密特正交化过程

Abstract: The inverse kinematics for trinal-branch robotic manipulator is researched based on the theory of linear equations set and conditional extremum, and an improved algorithm for least-norm inverse kinematics solution is proposed. The complicated calculation in conventional algorithm for the generalized inverse of Jacobian is avoided in this algorithm, especially, if the joint degree of each handling branch is equal to or more than the dimension of task space, a further simplified calculation can be obtained with the introduction of the Schimidt orthogonalization procedure. The proposed algorithm is of the higher real-time computation capacity than the common method, through the simulation of carrying a single object, the validity of the proposed algorithm is certificated.

Key words: trinal-branch, least-norm, inverse kinematics, Schimidt orthogonalization procedure

中图分类号: