基于改进引力搜索算法的稀布同心圆环阵优化

Optimization for Sparse Concentric Rings Array Based on Improved Gravitational Search Algorithm

提出一种改进的引力搜索算法,通过引入惯性质量加权因子,加快算法的收敛速度,通过引入遗传算法的变异算子,提高引力搜索算法的局部搜索能力并改善种群多样性,解决了引力搜索算法的早熟收敛问题。在阵列孔径、阵元个数及阵元间隔约束一定的情况下,对同心圆环阵进行稀布优化,以获得最低的峰值旁瓣电平,使旁瓣性能达到设计要求。实验结果证明了该改进方法的可行性和有效性。

An improved gravitational search algorithm（ IGSA） is proposed in the paper. By introducing the weighted factor of inertial mass,the convergence speed of the algorithm is accelerated,and by introducing the mutation factor of genetic algorithm,the local search capability and population diversity of GSA are improved,which solves the premature convergence problem well. Given determinate array aperture,array elements number and interval of the array elements,the sparse concentric rings array is optimized to obtain the lowest peak sidelobe level that meets the designing request. Simulation results prove the feasibility and efficiency of the proposed method.