利用混沌麻雀搜索算法合成稀疏均匀激励同心环阵列

IF 1.2 4区 计算机科学 Q4 ENGINEERING, ELECTRICAL & ELECTRONIC
Bin Wang, Xue Tian, Kui Tao
{"title":"利用混沌麻雀搜索算法合成稀疏均匀激励同心环阵列","authors":"Bin Wang, Xue Tian, Kui Tao","doi":"10.1155/2023/2926111","DOIUrl":null,"url":null,"abstract":"In this paper, an effective synthesis method for sparse uniformly excited concentric ring array (CRA) element positions featuring a minimum sidelobe level (SLL) is presented. This method is based on the chaos sparrow search algorithm (CSSA), which can search for the optimal solution under multiple constraints. By improving the constraint on the number of array elements on each ring, the solution range of the optimal solution is further reduced, and the global search ability of the algorithm is effectively improved by introducing tent mapping into the algorithm to initialize the population. Numerical examples are presented to assess the effectiveness and reliability of the proposed method, showing that it can achieve better results than existing methods in the design of sparse concentric ring array arrangements.","PeriodicalId":54392,"journal":{"name":"International Journal of Antennas and Propagation","volume":" ","pages":""},"PeriodicalIF":1.2000,"publicationDate":"2023-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Synthesis of Sparse Uniformly Excited Concentric Ring Arrays Using the Chaos Sparrow Search Algorithm\",\"authors\":\"Bin Wang, Xue Tian, Kui Tao\",\"doi\":\"10.1155/2023/2926111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an effective synthesis method for sparse uniformly excited concentric ring array (CRA) element positions featuring a minimum sidelobe level (SLL) is presented. This method is based on the chaos sparrow search algorithm (CSSA), which can search for the optimal solution under multiple constraints. By improving the constraint on the number of array elements on each ring, the solution range of the optimal solution is further reduced, and the global search ability of the algorithm is effectively improved by introducing tent mapping into the algorithm to initialize the population. Numerical examples are presented to assess the effectiveness and reliability of the proposed method, showing that it can achieve better results than existing methods in the design of sparse concentric ring array arrangements.\",\"PeriodicalId\":54392,\"journal\":{\"name\":\"International Journal of Antennas and Propagation\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2023-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Antennas and Propagation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1155/2023/2926111\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Antennas and Propagation","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1155/2023/2926111","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种具有最小旁瓣电平(SLL)的稀疏均匀激励同心环阵列(CRA)单元位置的有效综合方法。该方法基于混沌麻雀搜索算法(CSSA),可以在多个约束条件下搜索最优解。通过改进对每个环上数组元素个数的约束,进一步缩小了最优解的解范围,并通过在算法中引入帐篷映射来初始化种群,有效地提高了算法的全局搜索能力。数值算例验证了该方法的有效性和可靠性,结果表明,该方法在稀疏同心环阵列布置设计中比现有方法取得了更好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Synthesis of Sparse Uniformly Excited Concentric Ring Arrays Using the Chaos Sparrow Search Algorithm
In this paper, an effective synthesis method for sparse uniformly excited concentric ring array (CRA) element positions featuring a minimum sidelobe level (SLL) is presented. This method is based on the chaos sparrow search algorithm (CSSA), which can search for the optimal solution under multiple constraints. By improving the constraint on the number of array elements on each ring, the solution range of the optimal solution is further reduced, and the global search ability of the algorithm is effectively improved by introducing tent mapping into the algorithm to initialize the population. Numerical examples are presented to assess the effectiveness and reliability of the proposed method, showing that it can achieve better results than existing methods in the design of sparse concentric ring array arrangements.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Antennas and Propagation
International Journal of Antennas and Propagation ENGINEERING, ELECTRICAL & ELECTRONIC-TELECOMMUNICATIONS
CiteScore
3.10
自引率
13.30%
发文量
158
审稿时长
3.8 months
期刊介绍: International Journal of Antennas and Propagation publishes papers on the design, analysis, and applications of antennas, along with theoretical and practical studies relating the propagation of electromagnetic waves at all relevant frequencies, through space, air, and other media. As well as original research, the International Journal of Antennas and Propagation also publishes focused review articles that examine the state of the art, identify emerging trends, and suggest future directions for developing fields.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信