改进算术优化算法用于稀布平面阵列综合

doi:10.19665/j.issn1001-2400.2023.03.019

Abstract

Abstract:

An array antenna synthesis algorithm based on an improved arithmetic optimization algorithm is proposed to address the problems of sidelobe level suppression and null steering synthesis of sparse planar array radiation pattern.First,the math optimizer accelerated in the arithmetic optimization algorithm is reconstructed using a nonlinear function to balance the exploitation and exploration process weights.Second,top three best individuals are used instead of the current best optimal individuals for exploration and exploitation and an elite variation strategy is introduced to enhance the ability of the algorithm to escape from the local optimum and improve the convergence accuracy of the algorithm.Finally,an adaptive matrix mapping law is proposed to judge the current array element distribution,and if it does not satisfy the minimum array element spacing constraint,it is adjusted by an adjustment strategy to avoid infeasible solutions while ensuring the degrees of freedom of the array element.Compared with the existing algorithms in the literature,the improved arithmetic optimization algorithm has improved the optimization accuracy and stability of both single-peak and multi-peak standard test functions; In the experiments of sparse planar array sidelobe level suppression and null synthesis,the proposed algorithm can synthesize a better peak sidelobe level and null depth,which proves the effectiveness of the proposed algorithm.

Key words: array synthesis, sparse arrays, matrix mapping laws, arithmetic optimization algorithms

CLC Number:

TN92

GUO Qiang,LIU Congye,WANG Yani,WANG Yong,CHERNOGOR Leonid. Improved arithmetic optimization algorithm for sparse planar arrays synthesis[J].Journal of Xidian University, 2023, 50(3): 202-212.

Figures/Tables 14

函数	搜索空间
f₁= $∑ i = 1 D x i 2$	$- 100,100$
f₂= $∑ i = 1 D x i$ + $∏ i = 1 n x i$	$- 10,10$
f₃= $∑ i = 1 D ∑ j = 1 i x j 2$	$- 100,100$
f₄= $∑ i = 1 D - 1 100 (x i 2 - x i + 1) 2 + (1 - x i) 2$	$- 30,30$
f₅= $∑ i = 1 D x i 2 - 10 c o s (2 π x i) + 10$	$- 5.12,5.12$
f₆=-20exp $- 0.2 1 D ∑ i = 1 D x i 2 1 / 2$ -exp $1 D ∑ i = 1 D c o s (2 π x i)$ +20+e	$- 32,32$
f₇=1+ $14000 ∑ i = 1 D x i 2$ - $∏ i = 1 D$ cos $x i (i) 1 / 2$	$- 600,600$

References 17

[1]	JIANG Y, ZHANG S, GUO Q. An Effective Two-Step Approach to the Synthesis of Uniform Amplitude Linear Arrays[J]. IEEE Antennas and Wireless Propagation Letters, 2016, 16:437-440. doi: 10.1109/LAWP.2016.2582322
[2]	DARVISH A, EBRAHIMZADEH A. Improved Fruit-Fly Optimization Algorithm and Its Applications in Antenna Arrays Synthesis[J]. IEEE Transactions on Antennas and Propagation, 2018, 66(4):1756-1766. doi: 10.1109/TAP.2018.2800695
[3]	JI S, TOMURA T, HIROKAWA J. Fast Analysis and Bandwidth Enhancement of the Radiating Subarray by Method of Moments for A Parallel-Plate Slot Array Antenna with Perpendicular-Corporate Feed[J]. IEEE Transactions on Antennas and Propagation, 2021, 70(4):2645-2655. doi: 10.1109/TAP.2021.3119059
[4]	ELKHAWAGA A M, MAHMOUD N M, ABD ELNABY M M, et al. New Hybrid Approaches for SLL Reduction and Size Miniaturization of Planar Antenna Arrays Based on 2D Convolution and Genetic Algorithm[J]. Alexandria Engineering Journal, 2022, 61(9):7233-7264. doi: 10.1016/j.aej.2021.12.065
[5]	YANG J, YANG P, YANG F, et al. A Hybrid Approach for the Synthesis of Nonuniformly-Spaced Linear Subarrays[J]. IEEE Transactions on Antennas and Propagation, 2020, 69(1):195-205. doi: 10.1109/TAP.8
[6]	梁爽, 孙庚, 刘衍珩. 改进布谷鸟算法用于阵列天线方向图优化[J]. 西安电子科技大学学报, 2019, 46(1):174-180.
	LIANG Shuang, SUN Geng, LIU Yanheng. Improved Cuckoo Search Algorithm for Optimizing the Beam Patterns of Linear Antenna Arrays[J]. Journal of Xidian University, 2019, 46(1):174-180.
[7]	LIU F, LIU Y, HAN F, et al. Synthesis of Large Unequally Spaced Planar Arrays Utilizing Differential Evolution with New Encoding Mechanism and Cauchy Mutation[J]. IEEE Transactions on Antennas and Propagation, 2020, 68(6):4406-4416. doi: 10.1109/TAP.8
[8]	LI R, XU L, CHEN X, et al. Array Pattern Synthesis Using a Hybrid Differential Evolution and Analytic Algorithm[J]. Electronics, 2021, 10(18):2227. doi: 10.3390/electronics10182227
[9]	国强, 李佳莹, 王亚妮. 改进郊狼算法用于直线阵列零陷综合[J]. 西安电子科技大学学报, 2021, 48(6):172-178.
	GUO Qiang, LI Jiaying, WANG Yani. Synthesis of Linear Arrays with Sidelobe Suppression and Null Steering Using the Improved Coyeto Optimization Algorithm[J]. Journal of Xidian University, 2021, 48(6):172-178.
[10]	CHEN K, YUN X, HE Z, et al. Synthesis of Sparse Planar Arrays Using Modified Real Genetic Algorithm[J]. IEEE Transactions on Antennas and Propagation, 2007, 55(4):1067-1073. doi: 10.1109/TAP.2007.893375
[11]	LIU H, ZHAO H, LI W, et al. Synthesis of Sparse Planar Arrays Using Matrix Mapping and Differential Evolution[J]. IEEE Antennas and Wireless Propagation Letters, 2016, 15:1905-1908. doi: 10.1109/LAWP.2016.2542882
[12]	GUO H, JING G, ZHANG X, et al. Synthesis of Sparse Planar Antenna Arrays with Multiple Constraints[J]. International Journal of RF and Microwave Computer-Aided Engineering, 2019, 29(9):1-9.
[13]	DUTTA K P, MISRA B, MAHANTI G K. Meta-Heuristic Optimization Algorithms for Placement of Multiple Nulls and Minimization of Side Lobe Level in Quadrant Symmetric Sparse Array Antenna[J]. International Journal of Communication Systems, 2022, 35(10):1-15.
[14]	陈政宇, 刘正平, 谢菊兰, 等. 基于自调整映射法则的矩形稀布阵列优化方法[J]. 现代雷达, 2022, 44(5):12-18.
	CHEN Zhengyu, LIU Zhengping, XIE Julan, et al. An Optimization Method of Rectangular Sparse Array Based on Self-Adjusting Mapping Rule[J]. Modern Radar, 2022, 44(5):12-18.
[15]	ABUALIGAH L, DIABAT A, MIRJALILI S, et al. The Arithmetic Optimization Algorithm[J]. Computer Methods in Applied Mechanics and Engineering, 2021, 376:113609. doi: 10.1016/j.cma.2020.113609
[16]	ABUALIGAH L, DIABAT A, SUMARI P, et al. A Novel Evolutionary Arithmetic Optimization Algorithm for Multilevel Thresholding Segmentation of Covid-19 Ct Images[J]. Processes, 2021, 9(7):1155. doi: 10.3390/pr9071155
[17]	HU G, ZHONG J, DU B, ET A L. An Enhanced Hybrid Arithmetic Optimization Algorithm for Engineering Applications[J]. Computer Methods in Applied Mechanics and Engineering, 2022, 394:114901. doi: 10.1016/j.cma.2022.114901

函数	准则	AOA	DAOA	EHAOA	IAOA
f₁	平均值	1.01×10^-6	0.16×10^-7	1.41×10^-19	0
	标准差	3.51×10^-7	1.01×10^-7	2.56×10^-23	0
f₂	平均值	4.12×10^-4	2.06×10^-6	6.77×10^-17	0
	标准差	6.44×10^-4	2.17×10^-6	1.35×10^-16	0
f₃	平均值	2.69×10^-4	6.80×10^-5	4.85×10^-5	0
	标准差	3.04×10^-4	4.15×10^-5	9.15×10^-5	0
f₄	平均值	27.39	26.70	25.78	24.94
	标准差	0.28	0.27	0.74	0.29
f₅	平均值	4.00×10^-7	1.16×10^-9	1.21×10^-13	0
	标准差	3.43×10^-7	3.05×10^-9	1.02×10^-13	0
f₆	平均值	1.87×10^-4	2.84×10^-5	3.08×10^-13	0
	标准差	9.65×10^-5	3.07×10^-5	4.59×10^-13	0
f₇	平均值	8.27×10^-4	7.43×10^-4	0	0
	标准差	3.40×10^-3	2.30×10^-3	0	0

方法	适应度/dB		适应度/dB
方法	φ=0°	φ=90°	适应度/dB
DPMM	-32.32	-26.08	-58.40
IWO	-31.80	-25.10	-56.90
IAOA	-34.78	-26.69	-61.47

方法	NDL/dB		PSLL/dB
方法	θ=15°	θ=45°	PSLL/dB
SOS	-69.98	-70.01	-31.93
MOFO	-69.99	-70.00	-31.14
IAOA	-70.21	-72.98	-32.68

Improved arithmetic optimization algorithm for sparse planar arrays synthesis

RichHTML

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 14

References 17

Related Articles 4

Metrics

Comments

Recommended 10

[1]	GUO Qiang,LI Jiaying,WANG Yani. Synthesis of linear arrays with sidelobe suppression and null steering using the improved coyeto optimization algorithm [J]. Journal of Xidian University, 2021, 48(6): 172-178.
[2]	YANG Zhongping,ZHOU Qingsong,ZHANG Jianyun. Optimization algorithm for ultra-sparse arrays in regional energy focusing [J]. Journal of Xidian University, 2021, 48(4): 57-63.
[3]	WANG Wen-tao;LIU Ying;GONG Shu-xi;ZHANG Yu-jie;WANG Xing. RCS reduction of the array antenna by optimizing element spacing [J]. J4, 2010, 37(6): 1077-1081.
[4]	ZHANG Shuai;GONG Shu-xi;LU Bao;GONG Qi. Method for improving the optimization efficiency of sparse linear arrays [J]. J4, 2010, 37(5): 888-892+910.