Array sparse optimization method based on adaptive genetic algorithm

A technology of sparse optimization and genetic algorithm, applied in the field of radar reconnaissance array optimization, to achieve the effect of good direction finding performance and high direction finding performance

CN111160556AActive Publication Date: 2020-05-15HARBIN ENG UNIV
3 Cites 6 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Publication Date
2020-05-15

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention provides a sparse array optimization method based on an adaptive genetic algorithm in the technical field of radar reconnaissance array optimization. The method comprises the following steps of optimizing a model by proposing an array, encoding arrays, then, calculating a fitness value by utilizing a Cramer-Rao bound; selecting and crossly mutating the generated individuals by utilizing the fitness value, correspondingly changing crossover probability and mutation probability along with the increase of iteration times, finally optimizing to obtain the optimal individual, and taking the sparse array placement mode corresponding to the optimal individual as the optimal placement mode of array elements in the radar array. The method is a sparse array optimization method based ona self-adaptive genetic algorithm, an array element selection mode mainly takes the maximum array aperture and the minimum array element spacing as constraint conditions, takes a Cramer-Rao bound asa fitness function, and ensures that the array has relatively high direction finding performance under the conditions of the same array element number and the same minimum array element spacing.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention belongs to the technical field of radar reconnaissance array optimization, and particularly proposes an array sparse optimization method based on an adaptive genetic algorithm. The optimal sparse array obtained by the method optimization of the present invention constrains the maximum array aperture, the minimum Under the condition of the array element spacing, the array Cramereau limit value is the smallest, so that the direction finding accuracy is the highest during reconnaissance. Background technique

[0002] In practical applications, with the development of technology and the needs of operations, the passive receiving detection on the active phased array to complete the active and passive integration, and even the demand design of the passive radar detection system based on the phased array system have been regarded as Research hotspots. This makes it particularly important to select the array element antenna design for passive de...

Examples

Embodiment Construction

[0035] refer to figure 1 , is a flow chart of an array sparse optimization method based on an adaptive genetic algorithm of the present invention, wherein the array sparse optimization method based on an adaptive genetic algorithm includes the following steps:

[0036] Step 1. Determine the sparse optimization model of the planar array: change the position of the array to be sparsely optimized into a column of vectors, that is, an individual in the population represents an array to be sparsely optimized.

[0037] First, the position of each element of the array to be sparsely optimized is represented by a column of vectors, which is denoted as the individual to be sparsely f j,i (i=1,2,...,NP; j=1,2,...,L; L=M×M), where i represents the serial number of the individual in the corresponding population, L represents the number of full array elements, and M represents Number of array elements in azimuth and elevation, f j,i =1 means that there is an array element at the correspo...