基于改进RRT*算法的焊接机器人避障路径规划研究

Research on obstacle avoidance path planning for welding robots based on improved RRT* algorithm

  • 摘要: 针对快速扩展随机树(rapid-exploration random tree*, RRT*)算法在三维避障路径规划中存在盲目性、低效率和路径不光滑的问题,提出一种改进的RRT*算法,以提高焊接机器人路径规划的性能。通过采用双向搜索策略,缩短搜索时间;结合人工势场(artificial potential field, APF)算法与RRT*算法以提升路径平滑性并平衡局部优化与全局最优;提出一种基于角度与密度的改进APF算法策略,提高避障与路径引导效率;提出动态目标偏置策略和动态步长策略,以增强算法在障碍物密集和稀疏区域的自适应性及搜索效率;采用路径修剪策略缩短和平滑路径。最后,通过改进的RRT*算法与RRT*、APF-RRT*、Bi-APF-RRT*(bidirectional-APF-RRT*)3种算法对比仿真实验以及真机实验,验证了改进算法的高效性和实用性。

     

    Abstract: In response to the problems of blindness, low efficiency, and uneven path in 3D obstacle avoidance path planning of the rapid-exploration random tree* (RRT*) algorithm. This article proposes an improved RRT* algorithm to enhance the performance of welding robot path planning. This algorithm uses a bidirectional search strategy to shorten search time. Combining artificial potential field (APF) and RRT* algorithms to improve path smoothness and balance local optimization and global optimization; Propose an improved APF strategy based on angle and density to enhance the efficiency of obstacle avoidance and path guidance. Propose a dynamic target bias strategy and a dynamic step size strategy to enhance the algorithm's adaptability and search efficiency in areas with dense and sparse obstacles; Adopt a path pruning strategy to shorten and smooth the path. Finally, the efficiency and practicality of the improved algorithm were verified through comparative simulation experiments and real machine experiments with three algorithms: RRT*, APF-RRT*, and bidirectional-APF-RRT* (Bi-APF-RRT*).

     

/

返回文章
返回