遗传算法在阵列模式设计与优化中的应用

IEEE Antennas and Propagation Society International Symposium 1997. Digest Pub Date : 1997-07-13 DOI:10.1109/APS.1997.631500

F. Ares, E. Villanueva, J. Rodríguez, S. Rengarajan

{"title":"遗传算法在阵列模式设计与优化中的应用","authors":"F. Ares, E. Villanueva, J. Rodríguez, S. Rengarajan","doi":"10.1109/APS.1997.631500","DOIUrl":null,"url":null,"abstract":"This paper shows the advantage of using genetic algorithms in several cases of pattern synthesis. These methods are able to escape from local minima and maxima. It is also possible to search a small sample of a large solution space when the number of variables in the problem is very high. We present examples for linear and planar arrays.","PeriodicalId":283897,"journal":{"name":"IEEE Antennas and Propagation Society International Symposium 1997. Digest","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Application of genetic algorithms in the design and optimization of array patterns\",\"authors\":\"F. Ares, E. Villanueva, J. Rodríguez, S. Rengarajan\",\"doi\":\"10.1109/APS.1997.631500\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper shows the advantage of using genetic algorithms in several cases of pattern synthesis. These methods are able to escape from local minima and maxima. It is also possible to search a small sample of a large solution space when the number of variables in the problem is very high. We present examples for linear and planar arrays.\",\"PeriodicalId\":283897,\"journal\":{\"name\":\"IEEE Antennas and Propagation Society International Symposium 1997. Digest\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Antennas and Propagation Society International Symposium 1997. Digest\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APS.1997.631500\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Antennas and Propagation Society International Symposium 1997. Digest","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APS.1997.631500","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

本文展示了遗传算法在模式综合中的优势。这些方法可以避免局部极小值和局部极大值。当问题中的变量数量非常大时，也可以搜索大解空间中的小样本。我们给出了线性阵列和平面阵列的例子。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Application of genetic algorithms in the design and optimization of array patterns

This paper shows the advantage of using genetic algorithms in several cases of pattern synthesis. These methods are able to escape from local minima and maxima. It is also possible to search a small sample of a large solution space when the number of variables in the problem is very high. We present examples for linear and planar arrays.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE Antennas and Propagation Society International Symposium 1997. Digest

自引率

0.00%

发文量