基于GD-RRT-APF融合的机器人路径规划
Robot Path Planning with GD-RRT-APF Fusion
-
摘要: 文章提出一种目标导向下人工势场结合快速搜索树(GD-RRT-APF)的机器人路径规划算法,此算法在快速搜索树中添加目标导向启发,以减少搜索路径的随机扩展;同时结合人工势场目标点周围的势场分布优势,提升机器人路径规划的避障能力和路径最优效果。仿真分析和实验验证表明,与传统RRT算法相比,该算法规划的路径更短,虽然耗时增加3.63 s,但计算效率更高。结果表明,该算法在有效避免碰撞的前提下,降低了传统RRT算法的随机性,能够快速生成平滑、短距离的路径,从而能更加高效地完成路径规划任务。Abstract: This paper proposes a robot path planning algorithm based on artificial potential field combined with fast search tree (GD-RRT-APF) under the goal orientation. The algorithm adds the goal orientation heuristic in the fast search tree to reduce the random expansion of the search path, and combines the advantages of the potential field distribution around the target point to improve the obstacle avoidance and path optimality of the robot path planning. Through simulation analysis and experimental verification, and compared with the traditional RRT algorithm, the planning path is shorter, the time consumption is increased by 3.63 s, and the computational efficiency is higher. The results show that the algorithm effectively avoids collisions, reduces randomness of the traditional RRT algorithm, it can quickly generate smooth, short distance paths, and efficiently complete the path planning task.