基于GMM-RRT算法的机械臂路径规划

Path planning for robotic arms based on the GMM-RRT algorithm

  • 摘要: 针对传统快速扩展随机树(rapidly-exploring random tree, RRT)算法在机械臂避障路径规划应用中存在的搜索时间过长、路径冗余度高以及路径不平滑等问题,提出一种基于高斯混合模型采样策略改进的快速扩展随机树(Gaussian mixture model rapidly-exploring random tree, GMM-RRT)算法。首先,该算法通过在空间中引入多个高斯分布来构建引导性采样模型,并结合随机采样充分平衡算法的探索性和目标导向性;其次,加入自适应动态步长,提高复杂环境下算法的扩展效率和路径质量;最后,采用贪心剪枝策略去除初始路径中冗余点,并结合三次B样条曲线对剪枝后路径平滑处理。为验证改进算法的性能,通过Matlab搭建3种实验环境并分别对GMM-RRT在内的3种算法进行仿真实验。结果表明,在复杂三维环境下GMM-RRT算法的路径长度和总节点数比RRT算法分别减少了30.27%和84.32%,同时规划时长显著缩短。利用六轴机械臂进行三维避障路径规划实验验证了改进算法的可行性,可为机械臂提供更安全、平滑的避障路径,提高作业效率。

     

    Abstract: Aiming at the issues of long search time, high path redundancy, and non-smooth paths in the traditional rapidly-exploring random tree (RRT) algorithm for robotic arm obstacle avoidance path planning, a Gaussian mixture model RRT (GMM-RRT) algorithm based on an improved Gaussian mixture model sampling strategy is proposed. Firstly, the algorithm constructs a guided sampling model by introducing multiple Gaussian distributions in space and combines random sampling to balance exploration and target orientation. Secondly, an adaptive dynamic step size is incorporated to enhance expansion efficiency and path quality in complex environments. Finally, a greedy pruning strategy removes redundant points from the initial path, and the pruned path is smoothed using cubic B-spline curves. To evaluate the improved algorithm, three experimental environments were set up in Matlab, and comparative simulations were conducted with three algorithms including the improved RRT. The results show that in a complex 3D environment, the improved RRT algorithm reduces path length and the total number of nodes by 30.27% and 84.32%, respectively, while significantly shortening planning time. The feasibility of the improved algorithm was verified through six-axis robotic arm 3D obstacle avoidance path planning experiments, demonstrating its ability to provide safer and smoother paths and improve operational efficiency.

     

/

返回文章
返回