Improved Sparrow Search Algorithm for Rectangular Planar Array Synthesis

Abstract

To optimize sparse rectangular planar array antennas under multiple constraints, including array aperture, number of elements, and minimum element spacing, an improved sparrow search algorithm (ISSA) is proposed. Initially, a position distribution matrix is generated using the Blackman window weighting method. The sparrow search algorithm (SSA) is then enhanced by incorporating Kent mapping for population initialization, which improves the initial population’s diversity. Additionally, the strategy for updating the discoverer’s position integrates elements from the sine cosine algorithm (SCA), along with a nonlinear sine learning factor, thereby enhancing global search capability. Finally, a crossover strategy is embedded into the SSA to refine the optimization accuracy by improving the search methodology used by the vigilantes. To verify the efficacy of our approach, we carried out simulation experiments. The results demonstrate that this method significantly enhances the performance of the array antenna by reducing the peak sidelobe level and minimizing the zero-trap depth. These findings validate the reliability and effectiveness of the suggested method.

Keywords

• array antennas
• sparrow search algorithm (SSA)
• Blackman window
• sidelobe level
• zero-trap depth