基于BP-RRT*-FN算法的机械臂避障轨迹规划

Obstacle-Avoidance Trajectory Planning of Manipulator Based on BP-RRT*-FN Algorithm

  • 摘要: 针对多自由度机械臂在狭窄空间中存在的路径计算效率不高的问题,提出了一种改进的BP-RRT*-FN(Back Propagation- Rapidly-exploring Random Tree*-Fast Node delection)避障轨迹规划算法。为实现在3维空间运动轨迹规划更快速准确的收敛,利用距离加权函数计算节点采样概率,结合球包络障碍物和轴向包络法计算出无碰撞路径。通过阶段局部搜索,训练BP网络,预测每个阶段局部搜索的节点样本数量,自动进入下一阶段搜索。为减少冗余采样节点的产生,提高路径优化效率,应用FN算法随机删除节点。仿真结果表明平均采样节点分别优化了24.96%、25.30%,路径计算时间分别减少了6.47 s、3.87 s。在DOFBOT(Degree of Freedom RoBOT)六自由度机械臂实验,结果表明在完成避障运动的情况下,机械臂平均抓取时间减少了3.58 s、平均搜索时间减少了3.21 s。该算法能够提高多自由度机械臂在多障碍物空间的路径计算效率。

     

    Abstract: To address the inefficiency of path computation for multi-Degree-Of-Freedom manipulator in cluttered environments, an improved BP-RRT*-FN obstacle avoidance trajectory planning algorithm is proposed. To achieve a more rapid and accurate convergence in the 3D space trajectory planning, the node sampling probability is calculated using the distance weighting function. Combined with the spherical envelope obstacle and the axial envelope method, an obstacle-free path is calculated. Through stage-local search, the BP network is trained to predict the number of nodes sampled in each stage of the local search, and then automatically move on to the next stage of search. To reduce the generation of redundant sampled nodes and improve the efficiency of path optimization, the FN algorithm is applied to random delete nodes. The simulation results show that the average sampling nodes have respectively optimized by 24.96% and 25.30%, and the path calculation time has been reduced by 6.47 seconds and 3.87 seconds respectively. In the six-degree-of-freedom mechanical arm experiment, the results indicate that when completing the obstacle avoidance movement, the average grasping time of the mechanical arm has been reduced by 3.58 seconds and the average search time has been reduced by 3.21 seconds. This algorithm can improve the path calculation efficiency of multi-degree-of-freedom mechanical arms in multi-obstacle spaces.

     

/

返回文章
返回