Cuicui Cai, Yao Nie, Huan Wu, Maosheng Fu, Xianmeng Meng
{"title":"Pattern Synthesis of Antenna Array Based on Improved Flower Pollination Algorithm","authors":"Cuicui Cai, Yao Nie, Huan Wu, Maosheng Fu, Xianmeng Meng","doi":"10.1145/3569966.3570080","DOIUrl":null,"url":null,"abstract":"Synthesizing antenna arrays is an important issue in antenna design, which directly determines the performance of the antenna. In this letter, a novel improved flower pollination algorithm (IFPA) is proposed for the synthesis of antenna arrays. To enhance the search ability, the IFPA with Cauchy mutation, Elite strategy, and the dynamic conversion probability is presented. Firstly, Cauchy mutation is applied to the global pollination of the FPA, which increases the diversity of the population. Secondly, elite strategy is used for the local pollination of the FPA, which increases the search range of the optimal individual. Finally, the dynamic switch probability is used to improve the convergence speed of the algorithm. The antenna pattern synthesis is chosen to demonstrate the effectiveness and superiority of IFPA compared with other optimization algorithms. The results show that IFPA achieves the lowest maximum side-lobe level and deepest null depth level than particle swarm optimization (PSO) and FPA.","PeriodicalId":145580,"journal":{"name":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th International Conference on Computer Science and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3569966.3570080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Synthesizing antenna arrays is an important issue in antenna design, which directly determines the performance of the antenna. In this letter, a novel improved flower pollination algorithm (IFPA) is proposed for the synthesis of antenna arrays. To enhance the search ability, the IFPA with Cauchy mutation, Elite strategy, and the dynamic conversion probability is presented. Firstly, Cauchy mutation is applied to the global pollination of the FPA, which increases the diversity of the population. Secondly, elite strategy is used for the local pollination of the FPA, which increases the search range of the optimal individual. Finally, the dynamic switch probability is used to improve the convergence speed of the algorithm. The antenna pattern synthesis is chosen to demonstrate the effectiveness and superiority of IFPA compared with other optimization algorithms. The results show that IFPA achieves the lowest maximum side-lobe level and deepest null depth level than particle swarm optimization (PSO) and FPA.