自适应A*算法增强时空优化的无人机协同轨迹规划
CSTR:
作者:
作者单位:

(1.北京航空航天大学 人工智能学院,北京 100191; 2.北京航空航天大学 自动化科学与电气工程学院,北京 100191; 3.北京航空航天大学 无人系统研究院,北京 100191)

作者简介:

王羽楠(2002—),女,硕士研究生;化永朝(1992—),男,副教授,博士生导师; 董希旺(1985—),男,教授,博士生导师

通讯作者:

中图分类号:

TP13

基金项目:

国家自然科学基金(62473027, U7,9, 8,1)


Adaptive A* algorithm-enhanced spatiotemporal optimization for unmanned aerial vehicle cooperative trajectory planning
Author:
Affiliation:

(1.School of Artificial Intelligence, Beihang University, Beijing 100191, China; 2.School of Automation Science and Electrical Engineering, Beihang University, Beijing 100191, China; 3.Institute of Unmanned System, Beihang University, Beijing 100191, China)

Fund Project:

undefined

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    为解决分层规划中的前端基于固定分辨率的路径搜索效率与精度不能兼顾、后端多约束的时空联合优化计算复杂度高且求解困难的问题,提出了一种基于自适应A*-MINCO(adaptive A*-minimum control, AAM)规划器的分层运动规划框架。首先,该框架由前端自适应搜索模块与后端时空联合优化模块组成,并以滚动时域的方式协同运行,实现从几何路径生成到动态可行轨迹的全流程规划。其次,前端部分设计的自适应A*算法能够根据环境结构复杂度动态调整搜索分辨率,从而在开阔区域保持高效率、在狭窄区域保证高精度;后端部分则构建了基于MINCO参数化的时空联合优化模型,将轨迹平滑度、时间效率、动力学可行性、环境安全,以及集群协同避碰等多目标整合于一个可微的代价函数中。最后,采用L-BFGS (limited-memory broyden-fletcher-goldfarb-shanno)算法实现高效求解。在立柱阵列、窄墙道,以及长墙壁等多种复杂仿真场景中的对比实验表明,所提出的AAM规划器在规划成功率、计算效率和轨迹质量上均优于基线方法;在保证高规划成功率和轨迹平滑性的前提下,其平均规划效率提升18.4%,轨迹总代价平均降低15.3%。

    Abstract:

    To solve the problems that front-end path search based on a fixed resolution in hierarchical planning cannot balance efficiency and accuracy, and back-end spatiotemporal joint optimization with multiple constraints has high computational complexity and is difficult to solve, this paper proposed a hierarchical motion planning framework based on an adaptive A*-minimum control (AAM) planner. First, this framework consisted of a front-end adaptive search module and a back-end spatiotemporal joint optimization module and operated cooperatively in a receding horizon manner to achieve full-process planning from geometric path generation to dynamically feasible trajectories. Second, the adaptive A* algorithm designed in the front-end part could dynamically adjust the search resolution according to the environmental structure complexity, thereby maintaining high efficiency in open areas and ensuring high precision in narrow areas. The back-end part constructed a spatiotemporal joint optimization model based on MINCO parameterization, integrating multiple objectives such as trajectory smoothness, time efficiency, dynamic feasibility, environmental safety, and swarm cooperative collision avoidance into a differentiable cost function. Finally, this paper adopted the limited-memory broyden-fletcher-goldfarb-shanno (L-BFGS) algorithm to achieve an efficient solution. Comparative experiments in multiple complex simulation scenarios such as pole arrays, narrow gaps, and long walls indicate that the proposed AAM planner outperforms the baseline methods in planning success rate, computational efficiency, and trajectory quality; under the premise of ensuring a high planning success rate and trajectory smoothness, its average planning efficiency increases by 18.4%, and the total trajectory cost decreases by 15.3% on average.

    参考文献
    相似文献
    引证文献
引用本文

王羽楠,罗炯,刘宇寰,化永朝,李晓多,董希旺.自适应A*算法增强时空优化的无人机协同轨迹规划[J].哈尔滨工业大学学报,2026,58(8):113. DOI:10.11918/202510107

复制
分享
相关视频

文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2025-10-31
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2026-08-29
  • 出版日期:
文章二维码