一种应用于天线阵方向图综合的改进遗传算法  

An Improved Genetic Algorithm Applied in Linear Arrays Pattern Synthesis

作　　者：杨莘元[1] 杨林[1] 

机构地区：[1]哈尔滨工程大学信息与通信工程学院,哈尔滨150001

出　　处：《弹箭与制导学报》2006年第S7期647-649,共3页Journal of Projectiles,Rockets,Missiles and Guidance

基　　金：国防预研基金项目资助

摘　　要：提出了一种改进的遗传算法对线天线阵进行方向图综合,在进化初期和后期,分别采用不同的选择,变异的汁算,从而在解空间的搜索过程中有效地实现了全局搜索,避免过早的陷入局部极值,并且有较快的收敛速度,基本摆脱了对初始群体的依赖。针对小型阵列,通过适应度函数的改进.使之摆脱了收敛过程中容易出现的畸变现象,计算结果表明算法很好的实现了设计要求。An improved genetic algorithm is demonstrated and applied in synthesis of linear arrays pattern.The algorithm adopts different means of selection and mutation in evolution's initial stages and anapaest,so in search of space effec- tively realizes general search and avoids GA plunging in local extremum.The GA owes rather rapid convergent speed and basically shakes off depending on original colony.Aiming at minitype arrays,the GA gets rid of aberrance during the course of convergence by improving fitness function.The results show that the algorithm completes the required de- sign very well.

关 键 词：遗传算法 线天线阵 方向图综合 

分 类 号：TN820.15[电子电信—信息与通信工程] TP18[自动化与计算机技术—控制理论与控制工程]