基于B样条曲线及遗传算法求解TA/TA问题  

Solution of TA/TA Based on B-Spline and Genetic Algorithm

作　　者：冯琦[1] 周德云[1] 

机构地区：[1]西北工业大学电子工程系,西安710072

出　　处：《电光与控制》2001年第4期44-47,共4页Electronics Optics & Control

基　　金：航空基金资助;博士点基金资助

摘　　要：主要讨论了水平面上空面导弹 TA/ TA(地形回避 /威胁回避 )问题。首先通过Dijkstra算法求出地形、威胁包络的最短及几个较短路径通道 ;用所求通道上的关键点作为三次 B-样条曲线的顶点 ,近似拟合导弹飞行路线 ;以本文提出的最小距离法生成适应度函数 ,考虑导弹机动能力的约束 ,通过遗传算法来调整 B-样条曲线的顶点 ,从而寻找出性能指标最优的可飞行样条曲线 ;根据所求出的最优样条曲线给出导弹航路点。通过大量的仿真实验 ,证明该方法是可行的 ,具有快速性并适用于大范围、复杂地形和威胁环境。Firstly, the shortest route channel and some subordinations for terrain and threat envelope are found out by optimization techniques and Dijkstra algorithm. The key points on the known channel are used as the vertexes of B Spline curve. By using GA to adjust these vertexes, the least distance method to build its fitness function and by taking account of flight maneuvering constraint, the optimal and feasible curve is established. The flight course point is given based on the optimal curve. The algorithm has been proved to be feasible and fast through a large number of simulations, being suitable for the large scope areas with complicated terrains and threats.

关 键 词：最优航迹 地形回避/威胁回避 遗传算法 最小距离法 B样条曲线 TA/TA问题 空对面导弹 

分 类 号：TJ013.2[兵器科学与技术—兵器发射理论与技术]