Abstract
In this paper, a novel hybrid Invasive Weed Optimization (IWO) and Cuckoo Search (CS) algorithm (IWO/CS) is presented for phase-only pattern synthesis of large array antenna. The hybrid IWO/CS algorithm embeds the Levy flight of CS algorithm into IWO algorithm as a global guide, thereby enhancing the global search ability of the algorithm. At the same time, in order to avoid trapping into the local optimal solution, mutation operator is introduced to enhance search ability of the algorithm. Finally, competitive exclusion operation is improved to maintain the diversity of population. The hybrid algorithm is applied to phase-only beam shaping to achieve main lobe broadening and side lobe depression. Simulation results demonstrate the superiority of the hybrid IWO and CS algorithm.
Highlights
In recent years, more and more researchers paid their attention to the field of array pattern synthesis as the core issue of antenna research
From the above comparative experiments, it can be seen that the convergence performance of the fitness function of the hybrid Invasive Weed Optimization (IWO)/Cuckoo Search (CS) algorithm is better than that of the IWO/WDO algorithm, and the main lobe width and side lobe level are better than the comparison algorithm at the same time
A novel hybrid IWO/CS algorithm is presented, which is applied to the phaseonly array pattern synthesis
Summary
More and more researchers paid their attention to the field of array pattern synthesis as the core issue of antenna research. In [3], phase-only weighted of low side lobe and pattern nulls were realized by using iterative phase perturbation technique These methods are mainly applied to low side lobe and beam nulls, and the main lobe broadening ability is weak. Dhanesh [9] applied the differential evolution algorithm to the position-phase synthesis optimization problem. In [10], a hybrid IWO/WDO algorithm was proposed to implement pattern nulls by position-only control. A hybrid IWO/CS optimization algorithm is proposed for phase-only beam shaping of planar array. In order to maintain the diversity of population, a modified global random selection is applied to the competitive exclusion mechanism. 2) Greedy selection: The fitness value of the seed via Levy flight is calculated. The best 80 percent of individuals were selected from the population, and 20 percent of individuals were randomly selected from the remaining individuals, otherwise repeat step 1 until the algorithm meets the stopping criterion
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
