QIAO Yunxia, WANG Qing, YANG Yuan, et al. Smooth path planning based on backward obstacle search A* algorithm[J]. 2020, (8): 127-129. DOI: 10.13873/J.1000-9787(2020)08-0127-03.
基于背向障碍物搜索A*算法的平滑路径规划
摘要
提出一种基于背向障碍物搜索方式的改进A
*
算法。为了剔除路径中不必要的转折点
同时保证与障碍物的距离
采用提取最优转折点策略。引入三次均匀B样条插值函数
平滑优化转折点之后的路径。仿真实验证明:提出的改进A
*
路径规划算法
保证了规划出的路径与障碍物留有一定距离
且总体路径更加平滑
更有利于移动机器人的控制。
Abstract
An improved A
*
algorithm based on the back obstacle searching method is proposed. In order to eliminate unnecessary turning points in the path
while ensuring the distance from the obstacle
adopting the strategy of extracting the optimal turning point. Introduce the cubic uniform B-spline interpolation function to smoothly optimize the path after the turning point. Simulation experiment proves that the proposed improved A
*
path planning algorithm ensures that the planned path and the obstacle have a certain distance
and the overall path is more smoother
which is more conducive to the control of the mobile robot.