单纯形-入侵杂草算法在阵列天线波束赋形的应用

梁静; 李朝伟; 陈智慧; 樊小景

doi:10.15892/j.cnki.djzdxb.2015.06.042

2015 , Vol. 35 >Issue 6: 165 - 167,173

DOI: https://doi.org/10.15892/j.cnki.djzdxb.2015.06.042

摘要

针对入侵杂草算法在全局搜索过程中收敛速度慢的问题,文中提出基于单纯形的入侵杂草算法,并将该改进算法应用于阵列天线波束赋形中。单纯形-入侵杂草算法是利用单纯形局部搜索能力强,收敛速度快的特性,在平衡入侵杂草算法全局和局部寻优能力的同时,提高入侵杂草算法的收敛速度和计算精度。优化结果表明,与基本入侵杂草相比,该改进算法在阵列天线波束赋形中性能更佳。

关键词： 波束赋行; 入侵杂草算法; 单纯形搜索法

本文引用格式

梁静 , 李朝伟 , 陈智慧 , 樊小景 . 单纯形-入侵杂草算法在阵列天线波束赋形的应用[J]. 弹箭与制导学报, 2015 , 35(6) : 165 -167,173 . DOI: 10.15892/j.cnki.djzdxb.2015.06.042

Abstract

For overcoming the problem of slow convergent speed of IWO in global searching, simplex method( SM) invasive weed optimization (IWO) algorithm was proposed and applicated in beam-forming of array antennas. simplex method(SM) -invasive weed optimization (IWO) algorithm makes a balance between the global and local searching ability, and improves convergent speed by taking advantage of good local searching and fast convergent of SM. Simulation results prove that the improved algorithm has better performance compared with basic IWO.

Key words： shaped beam; invasive weed optimization algorithm; simplex method

[an error occurred while processing this directive]

参考文献

[1]	薛正辉, 李伟明. 阵列天线分析与综合[M]. 北京: 北京航空航天大学出版社, 2011.
[2]	MARCANO D, DURAN F. Synthesis of antenna arrays using genetic algorithms[J]. IEEE Antennas Propagat-Mag, 2000, 42 (6): 1692-1698.
[3]	陈滕博, 焦永昌, 张福顺. 基于改进型粒子群算法的阵列天线综合[J]. 微波学报, 2006, 22 (增刊): 39-43.
[4]	Mehrabian A R, Lucas C. A novel optimization algorithm inspired from weed colonization[J]. Ecological Informat-ics, 2006, 1 (3): 355-366.
[5]	Gourab Ghosh Roy, Swagatam Das, Prithwish Chakraborty. Design of non-uniform circular antenna arrays using a modi-fied invasive weed optimization algorithm[J]. IEEE Transacyions on Antennas and Propagation, 2011, 59 (1): 110-118.
[6]	陈宝林. 最优化理论与算法[M]. 北京: 清华大学出版社, 2005: 343-348.

Options

文章导航