RRT*-GSQ:一种适用于复杂果园场景的混合采样路径规划算法

    RRT*-GSQ: A hybrid sampling path planning algorithm for complex orchard scenarios

    • 摘要: 传统基于采样的路径规划算法,如改进快速探索随机树算法(rapidly-exploring random tree star(RRT*)),在非结构化果园环境中面临狭窄通道中采样效率低、收敛速度慢及计算成本高等问题。为应对这些挑战,该研究提出一种融合高斯采样与四叉树优化的新型混合全局路径规划算法(RRT*-gaussian sampling and quadtree optimization(RRT*-GSQ))。该方法综合运用了高斯混合采样策略、自适应步长与方向优化机制、四叉树-AABB(quadtree - axis-aligned bounding box)碰撞检测框架以及动态迭代控制策略,分别用以改进关键区域节点生成、增强避障能力、降低计算复杂度并实现更高效收敛。通过模拟果园环境试验,在无障碍与有障碍场景中,相较于传统RRT*算法,该算法节点评估次数分别降低67.57%与62.72%,搜索时间分别缩短79.72%与78.52%。在路径跟踪测试中,相较于传统RRT*算法,RRT*-GSQ算法在无障碍和有障碍环境中最终路径的横向均方根误差的基准值分别较传统RRT*算法降低41.5%和59.3%,纵向均方根误差的基准值分别降低57.2%和58.5%,且在无障碍和有障碍环境中的横向与纵向的最大绝对误差均在0.75 m以内。果园实地验证试验结果表明,相较于传统RRT*算法,该算法的平均跟踪误差在无障碍与有障碍场景下分别降低47.6%和58.3%,路径长度分别缩短5.1%和7.2%。本研究提出的RRT*-GSQ算法可有效提升果园轮式作业机器人的路径规划效率与导航精度,为果园环境中轮式机器人的高精度自主导航提供了一种较优解决方案,具有重要的工程应用价值。

       

      Abstract: Traditional sampling-based path planning algorithms, such as the rapidly-exploring random tree star (RRT*), encounter critical limitations in unstructured orchard environments, including low sampling efficiency in narrow passages, slow convergence, and high computational costs. To address these challenges, this paper proposes a novel hybrid global path planning algorithm integrating gaussian sampling and quadtree optimization(RRT*-GSQ). This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions, an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance, a Quadtree-AABB(quadtree - axis-aligned bounding box) collision detection framework to lower computational complexity, and a dynamic iteration control strategy for more efficient convergence. In obstacle-free and obstructed scenarios,compared with the conventional RRT*, the proposed algorithm reduced the number of node evaluations by 67.57% and 62.72%, and decreased the search time by 79.72% and 78.52%, respectively. In path tracking tests, the proposed algorithm achieved substantial reductions in the root mean square error(RMSE) of the final path compared to the conventional RRT*. Specifically, the lateral RMSE was reduced by 41.5% in obstacle-free environments and 59.3% in obstructed environments, while the longitudinal RMSE was reduced by 57.2% and 58.5%, respectively. Furthermore, the maximum absolute errors in both lateral and longitudinal directions were effectively constrained within 0.75 m. Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness, showing reductions in the mean tracking error of 47.6% (obstacle-free) and 58.3% (with obstructed), alongside a 5.1% and 7.2% shortening of the path length compared to the baseline method. The proposed RRT*-GSQ algorithm effectively enhances path planning efficiency and navigation accuracy for robots, presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications.

       

    /

    返回文章
    返回