Research On Circular Arrays Antenna Optimization And Design Based On Grey Wolf Optimizer

In the field of array antenna,the gain of sparse array is lower than full array with the same aperture,but it still has a better performance in relative pattern.The sparse array can realize the synthesis of the pattern graph by using fewer array elements,which greatly reduces the hardware design cost and complexity of the system.Therefore,researchers pay much attention to it.Especially in the conformal array,it has been widely used on multiple platforms such as ship-borne,air-borne,space-borne and missile-borne,because it can provide greater scanning coverage and give consideration to both stealth and aerodynamic performance of carrier platforms.As the basement of the conformal antenna array,circular array usually has higher side lobe-level than main lobe level in its pattern graph.In order to solve this problem,this paper studies a new grey wolf algorithm which is proposed in recent years.With the side-lobe level suppression as the optimization objective.It designs and studies the single ring array,concentric ring array and cylindrical concentric antenna array respectively.The main contents and research results of this paper are as follows:Firstly,the basic theory of array antenna and the main parameters for evaluating array performance in this paper are introduced,the pattern graph function of common array is deduced,and the concepts of sparse array and sparse array are introduced by taking rectangular planar array as an example.The circular array model is emphatically analyzed,and the window function of amplitude excitation in the existing research is analyzed.Secondly,the grey wolf algorithm is analyzed in detail,on the basis of in view of the traditional algorithm ignores the advantage in the process of hunting wolf dominate the weight change,this paper introduces two kinds of improved strategy: nonlinear rounded up strategy and the advantage of a wolf position Dynamic belief,this paper proposes a Dynamic-Weighting Grey Wolf Optimizer(DWGWO),and applies the improved algorithm to the single circle array yuan arrangement problem of the probabilistic reserves model is established and allowance model respectively,reduced the searching space,simplify the procedure of optimization.Furthermore,will be the object of study by the single circle array into concentric ring array(CRA),combined with the structure features of the CRA array will correspond with Ring radius,number of Arrays,and by encouraging three groups of vector is introduced into the model,simply by changing the parameters of the upper and lower boundary,can realize the CRA array in the optimization of a single or multiple dimensions.In addition,also on the premise of limiting the main lobe width has realized the CRA array synthesis problems.Compared with genetic algorithm,the method in this paper can avoid complex crossover,mutation and other operations,and has the advantage of simple operation.On the basis of this model,the optimization problem with array aperture,number and array spacing constraints is also discussed.Finally,the research object is extended to cylindrical conformal antenna array,the pattern graph function of cylindrical array is derived,and the probabilistic reservation model is applied to the sparse optimization problem of cylindrical array.At the same time,the optimization results under different sparsity rates are also discussed.What's more,on the premise of uniform full arrangement array,the optimization of the cylindrical conformal antenna array with only amplitude excitation is discussed,and the lower sidelobe level is obtained.