{"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}
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 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.