基于虚拟点的跨域变构飞行器再入覆盖区域快速生成
作者:
作者单位:

国防科技大学 智能科学学院

作者简介:

通讯作者:

中图分类号:

V448.235

基金项目:

国家自然科学基金资助项目(62173336, 92271108)


Rapid generation of reentry landing footprint for cross-domain morphing vehicle based on virtual points
Author:
Affiliation:

Fund Project:

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

    针对多维跨域变构飞行器多约束再入覆盖区域快速生成难题,提出一种融合虚拟点逼近与分段高斯伪谱的快速求解方法。该方法首先通过虚拟点逼近策略,将复杂的覆盖域边界求解问题分解为一系列指向虚拟目标点的最优轨迹生成问题,有效降低了求解维度与计算复杂度。在此基础上,采用分段高斯伪谱法将多约束最优控制问题转化为非线性规划问题,高效求解可同时伸缩、变后掠的多维变构飞行器再入轨迹。同时,利用虚拟点的分布规律生成高质量初始解,显著提升了算法的收敛速度。仿真结果表明,该方法有效提升了覆盖区域的生成效率与收敛性,可为变构飞行器任务规划与性能评估提供高效分析工具。

    Abstract:

    To address the challenge of rapidly generating the multi-constrained reentry landing footprint for multi-dimensional trans-atmospheric morphing vehicles, a rapid generation method is proposed by integrating virtual point approximation with an hp-adaptive Gauss pseudospectral method. The method first decomposes the complex problem of footprint boundary determination into a series of optimal trajectory generation subproblems targeting virtual points, which effectively reduces the solution's dimensionality and computational complexity. Subsequently, a segmented Gauss pseudospectral method is employed to transcribe each multi-constrained optimal control problem into a nonlinear programming problem, efficiently solving for reentry trajectories of vehicles with simultaneous span-extension and sweep-angle morphing capabilities. Furthermore, high-quality initial guesses are generated by leveraging the distribution of these virtual points, which significantly enhances the algorithm's convergence speed. Simulation results demonstrate that the proposed method significantly improves both the generation efficiency and convergence for the reachable footprint, providing an efficient analysis tool for the mission planning and performance evaluation of morphing vehicles.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2025-11-13
  • 最后修改日期:2026-05-15
  • 录用日期:2026-04-01
  • 在线发布日期:
  • 出版日期:
文章二维码