A large sparse array efficient comprehensive method based on a multi-agent genetic algorithm
A multi-agent, genetic algorithm technology, applied in the field of antennas, can solve the problems of easy premature convergence, unable to find the desired solution, trapped in the local optimal solution, etc., to reduce the number of iterations, increase the diversity, and improve the optimization efficiency. Effect
Active Publication Date: 2019-05-03
UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF10 Cites 6 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
However, in some engineering applications, one of the common problems of genetic algorithm is that it is easy to converge prematurely, and it is easy to fall into the local optimal solution and cannot find the expected desired solution.
Patent No. CN104102791A proposes a sparse construction method of antenna array based on quantum firefly search mechanism. Compared with traditional particle swarm algorithm and genetic algorithm, this method can find a higher quality solution, but this method can only be obtained by linear array synthesis. application
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
specific Embodiment approach 2
[0068] Consider the problem of synthesis of two large sparse arrays arranged in triangular grids with octagonal boundaries. Assuming the array size is N×N, refer to Figure 11 A schematic diagram of a rectangular array of triangular grids with N=7 is given. The center of the array, that is, the coordinate origin (0,0) is located at the intersection of two black dotted lines, and the coordinates of the triangular grid array are (m,n). The arrangement position can be determined by the following formula:
[0069]
[0070] Considering the octagonal boundary array scheme, the four corner position elements of the rectangular boundary array should be removed accordingly. If the side length of the removed isosceles right triangle is sN, the coordinate position of the array element of the triangular grid octagonal boundary array (m,n) can be determined by the following formula:
[0071]
[0072] Wherein, M=N-1-sN-round(sN-1 / 2) is the range of the octagonal array; round(·) is a ...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
The invention discloses a multi-agent-based genetic algorithm suitable for large-scale sparse array synthesis, and solves the problem that a traditional optimization algorithm is liable to fall into local optimum when performing sparse array synthesis. The method comprises the following implementation steps: constructing an antenna sparse array grid model; constructing an initial sparse array arrangement scheme, and using the initial sparse array arrangement scheme as an agent to form a multi-agent grid environment; For a multi-agent genetic algorithm, two improved strategies of agent transferand neighborhood expansion are provided; Sequentially carrying out neighborhood competition, neighborhood orthogonal crossing and variation operations on the multi-agent grid; Carrying out self-learning operation on the filial generation optimal agent; Updating the optimal intelligent physical ability value; and when the requirement for the maximum number of iterations is met, outputting an optimal array arrangement scheme of the antenna sparse array plane. By means of the fact that global control does not exist in the evolutionary process of the multi-agent system, each agent is an independent individual, and the purpose that small-scale population is used for rapid and efficient integration of a large-scale sparse phased array is achieved.
Description
technical field [0001] The invention belongs to the technical field of antennas, and relates to a sparse comprehensive construction method of a large antenna array, in particular to a comprehensive and efficient construction method of a large sparse array based on a multi-agent genetic algorithm. It can be used in the fields of radar, wireless communication and electronic countermeasures to minimize cost and feed network complexity. Background technique [0002] In modern electronic warfare, in order to effectively counter targets and improve radar anti-jamming capabilities, low or ultra-low sidelobe arrays are required for radar antennas. At present, extremely low sidelobe antennas have become an important part of high-performance electronic systems. In some array application examples, simple feed network, light weight, and narrow beam are required, such as radar, remote sensing, satellite communication, and biomedical imaging. Considering the basic principle of the anten...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/50G06N3/12
Inventor 杨仕文洪燕鸿马彦锴孙磊龙伟军李斌陈益凯屈世伟
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA