期刊文献+

基于序列凸优化的带地理约束的再入轨迹规划研究

Reentry trajectory planning with geographical constraints based on sequential convex optimization
原文传递
导出
摘要 针对同时带航路点、禁飞区地理约束的再入轨迹规划问题,基于序列凸优化方法进行研究。将归一化时间作为自变量,同时采用划分子航段方法,既有效解决了终端时间自由问题,又确保了航路点约束的满足。选取倾侧角变化速率作为新的控制变量,以解决收敛解中倾侧角高频振荡问题。在此基础之上,采用线性化方法处理禁飞区等非凸约束,构建出符合凸优化方法求解框架的数学模型。为避免数值迭代过程中的人工不可行现象,引入虚拟推力等松弛量并构建罚函数。仿真结果表明,本文算法对带地理约束的再入轨迹规划问题具有较强的鲁棒性和较高的求解精度。其求解结果可作为原始问题的可行解。 The problem of reentry trajectory planning with both waypoint and no-fly zone constraints is investigated using the sequential convex optimization method.By employing normalized time as the independent variable and adopting a sub-flight-segment division strategy,the free terminal time problem is not only effectively resolved,but the waypoint constraints are also rigorously satisfied.The change rate of the bank angle is selected as the new control variable to eliminate high-frequency oscillations in the converged solution.Furthermore,non-convex constraints such as no-fly zones are addressed through linearization methods,establishing a mathematical model compatible with the convex optimization framework.To mitigate artificial infeasibility during numerical iterations,relaxation variables such as virtual thrust are introduced,and a penalty function is constructed.The simulation results show that the proposed algorithm exhibits strong robustness and high accuracy in addressing the reentry trajectory planning problem with geographical constraints.The optimized solution can be used as a feasible solution for the original problem.
作者 孔民 李智军 戴良军 徐香香 Kong Min;Li Zhijun;Dai Liangjun;Xu Xiangxiang(AVIC HongDu,Nanchang 330024,China)
机构地区 航空工业洪都
出处 《战术导弹技术》 北大核心 2025年第6期80-88,115,共10页 Tactical Missile Technology
关键词 高超声速飞行器 再入轨迹规划 序列凸优化 航路点 禁飞区 归一化时间 线性化与松弛 hypersonic vehicle reentry trajectory planning sequential convex optimization waypoint no-fly zone normalized time linearization and relaxation
  • 相关文献

参考文献8

二级参考文献95

共引文献229

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部