Pattern Synthesis of Antenna Array Based on Improved Flower Pollination Algorithm

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于改进花授粉算法的天线阵方向图综合
天线阵列的合成是天线设计中的一个重要问题,它直接决定了天线的性能。在这篇文章中,提出了一种新的改进的花授粉算法(IFPA)用于天线阵列的合成。为了提高搜索能力,提出了具有柯西突变、精英策略和动态转换概率的IFPA算法。首先,将柯西突变应用于FPA的全球传粉,增加了种群的多样性;其次,采用精英策略对FPA进行局部授粉,增加了最优个体的搜索范围;最后,利用动态切换概率提高算法的收敛速度。与其他优化算法相比,选择天线方向图合成来验证IFPA算法的有效性和优越性。结果表明,与粒子群优化(PSO)和粒子群优化(FPA)相比,IFPA的最大旁瓣电平最低,零深度最深。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Accurate and Time-saving Deepfake Detection in Multi-face Scenarios Using Combined Features The Exponential Dynamic Analysis of Network Attention Based on Big Data Research on Data Governance and Data Migration based on Oracle Database Appliance in campus Research on Conformance Engineering process of Airborne Software quality Assurance in Civil Aviation Extending Take-Grant Model for More Flexible Privilege Propagation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1