Pattern Synthesis for Array Antennas based on Interpolation Gravitational Search Algorithm

A new algorithm known as interpolation gravitational search algorithm (IGSA) is proposed in this paper when be used to synthesize pattern for array with complicated side lobe and notch. First, a novel and adjustable coefficient q for inertia mass is introduced, which can render the particle large in inertia mass get larger and more attractive to other particles to access to more optimal location, so the convergence can be accelerated through varying the discrepancy of inertia mass M-i(t) of particles in a specific population. Second, a simplified quadratic approximation algorithm (SQA) is interpolated that can make the algorithm perform better in the aspect of optimum seeking, so the computational accuracy can be increased through utilizing the stronger local search ability of SQA. To verify the validation of the algorithm, the proposed IGSA is applied to commit pattern synthesis in terms of different targets. Simulation results show that the IGSA, as a whole, is better than the other algorithms the same kind, mainly because the IGSA can be possessed of faster speed in convergence and perform more accurate in optimization.