基于DCE-A*算法的无人机路径规划

UAV Path Planning Based on the DCE-A* Algorithm

  • 摘要: 随着无人机在复杂3维环境中的应用不断扩大,传统采用 26 邻域扩展的 A* 算法因搜索效率低、路径冗余和计算负担重,已难以同时满足路径规划的实时性与可行性需求。本文提出一种基于方向索引与扩展裁剪的DCE-A*算法(direction-cost-enhanced a* algorithm),通过引入方向得分机制优先扩展朝向目标点的间隔节点,并在扩展阶段引入Top-K节点筛选策略,仅保留朝向目标方向得分最高的K_\mathrmtop个节点,以降低冗余扩展。在后处理阶段结合高阶贝塞尔曲线全局拟合,提高路径的连续性与飞行可控性。构建多尺度3维栅格地图进行仿真实验,结果表明所提算法在保证路径可行性的前提下:相比传统 A*,总搜索节点数减少46%~66%,路径规划耗时降低45%~67%,成功搜索率提高约38%,并在复杂场景中路径长度缩短6.45%。

     

    Abstract: As unmanned aerial vehicles (UAVs) are increasingly deployed in complex three-dimensional environments, the traditional A* algorithm with 26-neighborhood expansion suffers from low search efficiency, redundant paths, and heavy computational burden, making it difficult to simultaneously satisfy the real-time and feasibility requirements of path planning. In this paper, a direction-cost-enhanced A* (DCE-A*) algorithm based on direction indexing and expansion pruning is proposed. A directional scoring mechanism is introduced to preferentially expand intermediate nodes oriented toward the target, and a Top-K node selection strategy is employed in the expansion stage to retain only the K_\mathrmtop nodes with the highest directional scores, thereby reducing redundant expansions. In the post-processing stage, a high-order Bézier curve is used for global path fitting to improve path continuity and flight controllability. Simulation experiments on multi-scale 3D grid maps show that, while ensuring path feasibility, the proposed algorithm reduces the total number of visited nodes by 46%~66%, decreases planning time by 45%~67%, increases the success rate of path search by about 38%, and shortens the path length by 6.45% in complex scenarios compared with the conventional A* algorithm.

     

/

返回文章
返回