首页> 外文期刊>International Journal of Advanced Robotic Systems >A rapidly exploring random tree optimization algorithm for space robotic manipulators guided by obstacle avoidance independent potential field
【24h】

A rapidly exploring random tree optimization algorithm for space robotic manipulators guided by obstacle avoidance independent potential field

机译:基于避障独立势场指导的空间机器人的快速探索随机树优化算法

获取原文
           

摘要

The crucial problem of obstacle avoidance path planning is to realize both reducing the operational cost and improving its efficiency. A rapidly exploring random tree optimization algorithm for space robotic manipulators guided by obstacle avoidance independent potential field is proposed in this article. Firstly, some responding layer factors related to operational cost are used as optimization objective to improve the operational reliability. On this basis, a potential field whose gradient is calculated off-line is established to guide expansion of rapidly exploring random tree. The potential field mainly considers indexes about manipulator itself, such as the minimum singular value of Jacobian matrix, manipulability, condition number, and joint limits of manipulator. Thus, it can stay the same for different obstacle avoidance path planning tasks. In addition, a K-nearest neighbora??based collision detection strategy is integrated for accelerating the algorithm. The strategy use the distance between manipulator and obstacles instead of the collision state of manipulator to estimate the distance between new sample configuration and obstacle. Finally, the proposed algorithm is verified by an 8-degree of freedom manipulator. The comparison between the proposed algorithm and a heuristic exploringa??based rapidly exploring random tree indicates that the algorithm can improve the efficiency of path planning and shows better kinematic performance in the task of obstacle avoidance.
机译:避障路径规划的关键问题是既要降低运营成本,又要提高效率。提出了一种以避障独立势场为指导的空间机器人的快速探索随机树优化算法。首先,将与运营成本相关的一些响应层因素作为优化目标,以提高运营可靠性。在此基础上,建立了离线计算梯度的势场,以指导快速探索随机树的扩展。势场主要考虑关于机械手本身的指标,例如雅可比矩阵的最小奇异值,可操纵性,条件数和机械手的联合极限。因此,对于不同的避障路径规划任务,它可以保持不变。此外,集成了一个基于K近邻算法的碰撞检测策略,以加速该算法。该策略使用操纵器和障碍物之间的距离而不是操纵器的碰撞状态来估计新样本配置和障碍物之间的距离。最后,通过8自由度操纵器对提出的算法进行了验证。所提算法与基于启发式探索的快速探索随机树的比较表明,该算法可以提高路径规划的效率,在避障任务中具有较好的运动学性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号