改进郊狼算法用于直线阵列零陷综合  

Synthesis of linear arrays with sidelobe suppression and null steering using the improved coyeto optimization algorithm

作　　者：国强[1] 李佳莹 王亚妮 GUO Qiang;LI Jiaying;WANG Yani(College of Information and Communication Engineering,Harbin Engineering University,Harbin 150000,China)

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

出　　处：《西安电子科技大学学报》2021年第6期172-178,共7页Journal of Xidian University

基　　金：国家重点研发计划战略性国际科技创新合作重点专项(2018YFE0206500)。

摘　　要：针对智能优化算法在具有最小旁瓣电平和零陷深度的均匀激励非周期直线阵列零陷综合中存在收敛速度慢及易于陷入局部最优的问题,提出了一种基于改进郊狼算法的直线阵列综合。该算法在郊狼算法的基础上,提出次优个体变异策略和全局最优组内引导策略。在次优个体中引入Hybrid映射扰动,小范围内发生变异,提高种群多样性,扩大搜索范围;构建一种新型的成长方式,提出全局最优组内引导策略,使算法更快地接近全局最优解,提高局部搜索能力并加快收敛速度。仿真结果显示,改进后的郊狼算法较原郊狼算法收敛速度明显加快,与遗传算法、布谷鸟算法、基于生物地理学的优化算法和Taguchi算法相比,所提算法获得了更优的旁瓣电平和零陷深度,证明了算法的有效性和优越性。Aiming at the problems in the synthesis of uniformly excited linear arrays with a minimum sidelobe level(SLL)and null steering,a linear array synthesis strategy of the improved coyeto optimization algorithm(ICOA)is proposed.Based on the coyeto optimization algorithm(COA),the suboptimal individual variation strategy and the global optimal intra-group guidance strategy are proposed.Hybrid mapping disturbance is introduced into suboptimal individuals,which causes variation within a small range,improving the population diversity and expanding the search scope.Besides,a new growth mode is constructed and a global optimal intra-group guidance strategy is proposed to make the algorithm approach the global optimal solution faster,enhancing the local search ability and accelerating the convergence speed.Simulation results show that the convergence speed of the ICOA is significantly faster than that of the COA.Compared with the genetic algorithm,cuckoo algorithm,biogeography-based optimization algorithm and Taguchi algorithm,the ICOA obtains better SLL and null steering,which proves the effectiveness and superiority of the proposed algorithm.

关 键 词：阵列综合 旁瓣抑制 零陷控制 均匀线阵 

分 类 号：TN92[电子电信—通信与信息系统]