首页> 外文期刊>Industrial Robot >Fault tolerant motion planning of robotic manipulators based on a nested RRT algorithm
【24h】

Fault tolerant motion planning of robotic manipulators based on a nested RRT algorithm

机译:基于嵌套RRT算法的机械手容错运动规划

获取原文
获取原文并翻译 | 示例
       

摘要

Purpose - The purpose of this paper is to present a new nested rapidly-exploring random tree (RRT) algorithm for fault tolerant motion planning of robotic manipulators. Design/methodology/approach - Another RRT algorithm is nested within the general RRT algorithm. This second nested level is used to check whether the new sampled node in the first nested level is fault tolerant. If a solution can be found in the second nested RRT, the reduced manipulator after failures at the new sampled node can still fulfill the remaining task and this new sampled node is added into the nodes of RRT in the first level. Thus, the nodes in the first level RRT algorithm are all fault tolerant postures. The final trajectory joined by these nodes is also obviously fault tolerant. Besides fault tolerance, this new nested RRT algorithm also can fulfill some secondary tasks such as improvement of dexterity and obstacle avoidance. Sufficient simulations and experiments of this new algorithm on fault tolerant motion planning of robotic manipulators are implemented. Findings - It is found that the new nested RRT algorithm can fulfill fault tolerance and some other secondary tasks at the same time. Compared to other existing fault tolerant algorithms, this new algorithm is more efficient. Originality/value - The paper presents a new nested RRT algorithm for fault tolerant motion planning.
机译:目的-本文的目的是提出一种新的嵌套快速探索随机树(RRT)算法,用于机器人机械手的容错运动规划。设计/方法/方法-另一种RRT算法嵌套在常规RRT算法中。此第二嵌套级别用于检查第一嵌套级别中的新采样节点是否容错。如果可以在第二个嵌套RRT中找到解决方案,则经过简化的操纵器在新的采样节点发生故障后仍然可以完成剩余的任务,并且将此新的采样节点添加到第一级的RRT节点中。因此,第一级RRT算法中的节点都是容错姿势。这些节点连接的最终轨迹显然也是容错的。除了容错功能之外,这种新的嵌套RRT算法还可以完成一些辅助任务,例如提高灵活性和避开障碍物。对该机器人机械手的容错运动规划进行了充分的仿真和实验。结果-发现新的嵌套RRT算法可以同时满足容错和其他一些辅助任务。与其他现有的容错算法相比,该新算法效率更高。创意/价值-本文提出了一种新的嵌套RRT算法,用于容错运动计划。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号