求解飞行轨迹最优化问题的组合算法  

AN EFFECTIVE COMBINATORIAL ALGORITHM FOR SOLVING THE PROBLEM OF THE OPTIMAL FLIGHT TRAJECTORIES

作　　者：林国华[1] 杨宏坤[1] 

机构地区：[1]空军工程学院

出　　处：《飞行力学》1994年第1期50-56,共7页Flight Dynamics

摘　　要：以共轭梯度法和二阶微分动态规划算法为基础，提出了一个有效的组合算法。该算法取上述两种算法的优点以补各自的缺点，具有较快的初始和终点收敛速度，并且对初值选择没有太高的要求。实际计算表明，它是求解飞行轨迹最优化问题的有力工具。A combinatorial algorithm was presented.It’s an effective realignment ofConjugate-Gradient Method and Second-Order Differential Dynamic Programming Algo-rithm. It has a rapid initial and ultimate rate of convergence,and It has good stability forthe initial value selections. Practical calculations were presented and showed that it’s apowerful tool for solving the problems of the optimal flight trajectories.

关 键 词：组合算法 风切变 飞行轨迹 

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