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

Active Publication Date: 2020-05-15
HARBIN ENG UNIV
View PDF3 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Existing literature shows that most of radar sparse array optimization belongs to the field of active radar array optimization, with the beam width as the constraint condition, but in practical applications, it is necessary to realize passive reconnaissance in the original active phased array, so a kind of passive reconnaissance is needed. Array sparse optimization method under constraints such as limited array range in radar field

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 more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Array sparse optimization method based on adaptive genetic algorithm
  • Array sparse optimization method based on adaptive genetic algorithm
  • Array sparse optimization method based on adaptive genetic algorithm

Examples

Experimental program
Comparison scheme
Effect test

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...

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

No PUM Login to view more

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.

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...

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
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06N3/12
CPCG06N3/126Y02A90/10
Inventor 陈涛汪夕琳史林郭立民
Owner HARBIN ENG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap