一种高效的无人机避障路径规划混合算法策略

An efficient hybrid algorithm strategy for UAV obstacle avoidance and path planning

  • 摘要: 现有路径规划算法中存在搜索类A*算法高度依赖网格地图、高分辨率下计算内存开销大和采样类RRT算法、RRT*算法搜索效率低、路径规划时间长等问题,提出了一种无人机避障路径混合算法。首先,根据A*算法对网格地图的依赖性提出了全方向可选择性的路径搜索策略;其次,根据采样类算法的强随机性和低搜索效率,提出了全局最佳路径搜索方向以及高效节点选取方式;在障碍物附近采用沿墙算法的思路,避免陷入局部最小值的同时进一步缩短路径规划的运行时间。仿真结果表明:在不同复杂度的障碍物环境中,混合算法相较于传统的A*算法、RRT算法和RRT*算法在路径规划时间方面均缩短96%以上、生成路径长度有不同程度的减少以及平均迭代次数均减少98%以上。因此该算法能够显著提升路径规划的效率,为无人机避障高效自主路径规划提供有力的支撑。

     

    Abstract:
    Background Among the existing path planning algorithms, the search-based A* algorithm is highly dependent on grid maps and incurs large computational memory overhead at high resolutions. Meanwhile, the sampling-based RRT algorithm and RRT* algorithm suffer from low search efficiency and long path planning time.
    Purpose Aiming at the shortcomings of existing algorithms and the requirement for real-time path planning, a brand-new hybrid algorithm strategy is proposed.
    Methods Firstly, based on the A* algorithm’s dependence on grid maps, an omnidirectional optional path search perspective is put forward. Secondly, in view of the strong randomness and low search efficiency of sampling-based algorithms, a global optimal path search direction and a new efficient node selection method are proposed. Near obstacles, the idea of a simple and convenient wall-following algorithm is adopted to avoid falling into local minima while further shortening the running time of path planning.
    Results Simulation results show that in obstacle environments of different complexities, compared with the traditional A* algorithm, RRT algorithm, and RRT* algorithm, the new hybrid algorithm reduces the path planning time by more than 96%, shortens the generated path length to varying degrees, and decreases the average number of iterations by more than 98%.
    Conclusions The Mixed algorithm demonstrates excellent adaptability in three typical environments: it can rapidly generate near-optimal paths in open and regular environments; it also achieves high planning efficiency in cluttered but wide-passage environments; and it can efficiently find short paths even in challenging environments with narrow passages. Comparisons with the A*, RRT, and RRT* algorithms further verify that the Mixed algorithm performs outstandingly in terms of both path quality and search efficiency.Therefore, this algorithm can significantly improve the efficiency of path planning and provide strong support for the efficient autonomous path planning of UAV obstacle avoidance.

     

/

返回文章
返回