Thinned arrays using genetic algorithms

R. Haupt, J. J. Menozzi, C. J. McCormack
{"title":"Thinned arrays using genetic algorithms","authors":"R. Haupt, J. J. Menozzi, C. J. McCormack","doi":"10.1109/APS.1993.385248","DOIUrl":null,"url":null,"abstract":"It is shown how to apply genetic algorithms (GAs) to arrive at an optimally thinned array. Consistent GA results from five array thinning optimizations for a 50-element linear array of isotropic point sources are shown. All of the runs are within 0.8dB of one another. A sample far-field pattern for the 50-element array resulting from the GA optimization is shown. The array patterns are optimized for the lowest maximum sidelobe level. It is concluded that a GA is ideal for optimizing the thinning of an array. The bits in a gene correspond to turning the element on or off. Although a GA is slow, it can handle very large problems involving many antenna elements.<<ETX>>","PeriodicalId":138141,"journal":{"name":"Proceedings of IEEE Antennas and Propagation Society International Symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1038","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE Antennas and Propagation Society International Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APS.1993.385248","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1038

Abstract

It is shown how to apply genetic algorithms (GAs) to arrive at an optimally thinned array. Consistent GA results from five array thinning optimizations for a 50-element linear array of isotropic point sources are shown. All of the runs are within 0.8dB of one another. A sample far-field pattern for the 50-element array resulting from the GA optimization is shown. The array patterns are optimized for the lowest maximum sidelobe level. It is concluded that a GA is ideal for optimizing the thinning of an array. The bits in a gene correspond to turning the element on or off. Although a GA is slow, it can handle very large problems involving many antenna elements.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用遗传算法的稀疏数组
展示了如何应用遗传算法(GAs)来获得最优的稀疏阵列。对50元各向同性点源线性阵列进行了5次阵列细化优化,得到一致的遗传算法结果。所有运行之间的误差都在0.8dB以内。给出了遗传算法优化后的50元阵列远场方向图示例。该阵列模式针对最小最大旁瓣电平进行了优化。结果表明,遗传算法是优化阵列细化的理想方法。基因中的位对应于打开或关闭该元素。虽然遗传算法很慢,但它可以处理涉及许多天线元件的非常大的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Electrical antenna volume for a scale of downsizing ITD formulation for corner diffraction Pillow distortion analysis for modular mesh antenna A low profile Archimedean spiral antenna Linearly tapered slot antenna with dielectric superstrate
×
引用
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