可重构3-RRR并联机器人的“点对点” 路径规划
DOI:
作者:
作者单位:

1.南京林业大学机械电子工程学院;2.常州大学 机械与轨道交通学院;3.南京航空航天大学 机电学院

作者简介:

通讯作者:

中图分类号:

基金项目:

国家自然科学基金(51405237);国家留学基金(201908320035)。


‘Point-to-Point’ Path Planning for Reconfigurable 3-RRR Parallel Robots
Author:
Affiliation:

College of Mechanical and Electronic Engineering, Nanjing Forestry University

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    通过拓扑重构可以提高并联机器人的静刚度、故障修复等性能,但机器人重构之后能否到达任意指定的位姿且不经过奇异位形,尚无定论。为此,以可重构3-RRR平面并联机器人为研究对象,提出了一种能够实现“点对点”路径跟踪的规划算法。首先,建立了机构重构之前的反向运动学模型,据此确定了六组重构序列。接着,构建了一种“四步”规划算法,适用于任意自由度的可重构并联机器人的“点对点”路径跟踪,具有直观的几何解释,并且能够消除全部的奇异位形;通过算例验证了规划算法的有效性。然后,基于螺旋理论,计算出各组参量下的输入、输出和局部传递指标值,据此,确定了重构序列下的最优输入参量。最后,将“点对点”路径规划算法推广至连续路径规划的情形。

    Abstract:

    Topological reconfiguration can improve the static stiffness and fault tolerance of parallel robots, but the problem of whether the robot can reach any specified pose without singular configuration has not been solved. Therefore, this paper takes the reconfigurable 3-RRR planar parallel robot as the research object, and proposes a path planning method that can realize ' point-to-point ' tracking. The path planning algorithm is suitable for reconfigurable parallel robots with arbitrary degrees of freedom. It has intuitive geometric interpretation and can eliminate all singular configurations. Firstly, the inverse kinematics model before reconfiguration is established, and six paths based on topological reconfiguration are found. After research, there are many ways to determine each path. Then, the formulas of the relevant parameters input in the path planning process are derived, and the correctness of the derivation results is verified by the prototype experiment. Further, based on the screw theory, the input and output transfer indexes under each input mode are calculated, and the optimal solution of the input mode is obtained by using the local transfer index. Finally, the ' point-to-point ' path planning algorithm is extended to continuous path planning.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2023-05-23
  • 最后修改日期:2023-09-13
  • 录用日期:2023-09-26
  • 在线发布日期:
  • 出版日期:
您是第位访问者
南京航空航天大学学报 ® 2024 版权所有
技术支持:北京勤云科技发展有限公司