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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com