众多临近空间飞行器的最优轨迹规划  

Optimal trajectory planning for multiple near-space vehicles

作　　者：马晓华[1,2] 南英[1] 惠耀洛 万正富 周生龙 

机构地区：[1]南京航空航天大学航天学院,江苏南京210016 [2]火箭军驻307厂军事代表室,江苏南京210006

出　　处：《飞行力学》2016年第2期68-71,74,共5页Flight Dynamics

基　　金：航空科学基金资助(20140152002)

摘　　要：针对众多临近空间飞行器在复杂飞行环境的最优轨迹规划问题,采用改进的动态规划法和基于共轭梯度法的多点边值组合算法求解了多目标优化问题,得到了全部飞行器的最优飞行轨迹。仿真结果表明,该算法能够在考虑多种环境条件约束和飞行器自身条件约束的情况下,快速规划出众多飞行器的最优飞行轨迹,具有一定的学术价值和工程应用价值。This paper presents a combinational algorithm of optimal 4-D trajectory planning for multiple near-space vehicles. An improved dynamic programming method and multiple-point-boundary algorithm based on conjugate gradient method are used to solve the multiple-object optimization problem. Flight numerical simulation results shown that this trajectory planning algorithm can globally optimize all trajectories for multiple near-space vehicles in real-time,considering external various environmental constraints and performance constraints of vehicles. Therefore this academic paper can be widely applied in engineering projects.

关 键 词：众多临近空间飞行器 飞行威胁区 飞行任务点 最优飞行轨迹 

分 类 号：V412.1[航空宇航科学与技术—航空宇航推进理论与工程]