升力式再入飞行器覆盖范围计算分析

Calculation of reachable landing locations of lift entry vehicle

摘要:

将升力式再入飞行器的覆盖范围生成问题转化成满足再入约束条件下的最大纵程、最小纵程、最大横程以及一定纵程下最大横程的轨迹优化问题,采用序列梯度-修复算法来解这一系列的轨迹优化问题,最后进行了仿真分析．仿真结果表明:本文采用的方法合理可行,升力式再入飞行器的覆盖范围为一个左右不对称的扇形区域．

Abstract:

In this paper, the problem of reachable landing locations generation is transformed into trajectory optimization of maximum downrange, minimum downrange, maximum crossrange and maximum crossrange at specified downrange under entry constraints, and the sequential gradient-restoration algorithm is used to solve the trajectory optimization problem. Numerical simulations are performed, and the simulation results show that the technology of reachable landing locations generation for lift entry vehicle is reasonable and feasible, and the reachable landing locations generation of lift entry vehicle is left-right asymmetry fan-shaped region. 