基于分层优化的飞行器实时航迹算法研究  

Study on the Real-time Route Planning Algorithm of the Aircraft Based on Hierarchical Architecture

作　　者：杜萍[1] 杨春[1] 毕义明[1] 

机构地区：[1]第二炮兵工程学院基础部,陕西西安710025

出　　处：《装备指挥技术学院学报》2007年第2期60-64,共5页Journal of the Academy of Equipment Command & Technology

摘　　要：针对飞行器的实时航迹规划问题，提出了一种基于分层优化的算法。首先根据启发代价函数预测下一个临时目标点的位置；其次通过一个有限项的多项式来逼近三维航迹在水平面内的投影，将航迹规划问题转化为多项式的系数寻优问题，利用微粒群算法进行优化搜索；最后结合逐次松驰法将所得航迹调整为可行航迹。用Matlab进行了仿真验证，证明了算法的有效性。For the real-time route planning of the aircrafts, this paper presents a algorithm based on hierarchical architecture. First of all, the next temporary target＇s position is predicted by heuristic function. Then a polynomial function with finite terms is used to approach the horizontal projection of the three dimension route. So the original planning problem is simplified to search the best series of values in the coefficient space of the polynomial function. Particle swarm optimization is introduced to solve this optimization problem. Finally, a feasible route can be generated by using iterative relaxation method. The Matlab simulation results demonstrate the hierarchical route planning algorithm is effective.

关 键 词：实时航迹规划 分层优化 微粒群算法 逐次松驰法 

分 类 号：E843[军事—战术学] E27