Method for array elements arrangement of l-shaped array antenna based on inheritance of acquired character

Patent metadata

Field	Value
Publication number	US-10931027-B2
Application number	US-201816335673-A
Country	US
Kind code	B2
Filing date	Feb 2, 2018
Priority date	May 16, 2017
Publication date	Feb 23, 2021
Grant date	Feb 23, 2021

Abstract

A method for array elements arrangement of an L-shaped array antenna based on inheritance of acquired character. The method relates to the field of array elements design for L-shaped array antenna. In order to solve the problem that the arrangement of the current L-shaped array antenna system has a weak local ability, the invention firstly encodes for the J_K array, then calculates a fitness of each chromosome in the population, randomly selects two parent chromosomes according to a overwriting probability of inheritance of acquired character, calculates a percentage of gene delivery, performs a overwriting operation to generate a new population, repeats the overwriting operation to generate the final new population; calculates the fitness of each chromosome in the population, repeats the iteration until a predetermined termination condition is met, and obtains the optimal population gene; then determines the array elements arrangement of the L-shaped array antenna according to the optimal population gene.

First claim

What is claimed:

1. A method for array elements arrangement of an L-shaped array antenna based on an inheritance of an acquired character, the method comprises:
step 1: a J_K array being an array with two columns of array elements of an adjacent boundary of the L-shaped array antenna, numbers of the two columns of array elements being J and K respectively; encoding for the J_K array:
using the J_K array as one chromosome, when forming a gene of an individual, using J+K groups of binary strings randomly generated to represent the J_K array, a number of bits of a binary digit string being Na, and using each binary digit string as one gene of the chromosome; meaning that each binary represents an array element spacing between the array element and a previous array element, and using the above method to generate J+K genes as an initial population of a genetic algorithm for preservation;
in order to facilitate the representation, using d to represent a total number J+K of the genes in the chromosome, there being d=J+K; at this time, denoting each chromosome as P k i , a gene string of P k i constituting {x k 1 (i), x k 2 (i), . . . , x k d (i)}, which is represented as P k i ={x k j (i), i=1, . . . , N G , j=1, . . . d}; wherein x k i (i) represents the gene and j represents a sequence number of the gene in the chromosome; the population G k ={P k i , i=1, 2 . . . N G }; wherein k is an algebra of population evolution; i represents a sequence number of the chromosome in the population; and N G represents a size of the population and is an even number;
step 2: performing one adjustment of the initial population; then calculating a fitness of each chromosome P k i in the population G k ;
step 3: performing an overwriting operation to generate a new population G k+1 ′:
step 3.1: randomly selecting two parent chromosome P k i 1 and P k i 2 and P k i 1 ={x k 1 (i 1 ), x k 2 (i 1 ), . . . x k i (i 1 )} j−1 d , P k i 1 ={x k 1 (i 2 ), x k 2 (i 2 ), . . . x k 1 (i 2 )} j−1 d , according to an overwriting probability ρ of the inheritance of the acquired character, wherein ρ∈(0,1];
step 3.2: comparing a first fitness function value f(P k i ) of the parent chromosome P k i 1 with a second fitness function value f(P k i ) of the parent chromosome P k i 2 , selecting a chromosome with a large fitness function value, assuming that
f(P k i 1 )>f(P k i 2 ),
then calculating a percentage p i or gene delivery:

p
t

=

(

f
⁡

(

P
k

i
1

)

f
⁡

(

P
k

i
1

)

+

f
⁡

(

P
k

i
2

)

)

,

and then calculating a number n i of the genes delivered according to the following formula:
n i =d×p i

wherein d is a total number of genes in the chromosome;
step 3.3: performing the overwriting operation:
firstly, denoting a chromosome with strong fitness as P k i 1 ′, preserving P k i 1 ′ as k+1 generation of chromosome P k+ i 1 ; denoting a chromosome with weak fitness as P k i 2 ′;
secondly, delivering a genes from the chromosome with strong fitness P k i 1 ′ to the chromosome with weak fitness P k i 1 ′ to form new weak chromosome {tilde over (P)} k i 1 , wherein positions of the delivered genes a randomly selected:
using {tilde over (P)} k i 1 as k+1 generation of chromosome P k+1 i 1 ;
step 3.4: repeating steps 3.1 to 3.3 N G times, generating a final new population G k+1 ′ after the overwriting operation;
step 4: performing a mutation operation, generating a new population G k+1 ater one optimization operation;
step 5: calculating the fitness of each chromosome P k+1 i in the population G k+1 , repeating the iteration from steps 3 to 4 until a predetermined termination condition is met to obtain an optimal population gene; then determining the array elements arrangement of the L-shaped array antenna according to the optimal population gene.

2. The method for the array elements arrangement of the L-shaped array antenna based on the inheritance of the acquired character according to claim 1 , wherein the process of performing the mutation operation in step 4 is performed by using a uniform mutation method, and a mutation probability is p m ; then generating the new population G k+1 after one optimization operation.

3. The method for the array elements arrangement of the L-shaped array antenna based on the inheritance of the acquired character according to claim 2 , wherein the adjustment process in one adjustment of the initial population performed in step 2 is as follows:
firstly, converting each generation of J+K binary strings into decimal digits, a value of the decimal digits converted by the binary strings correspondingly representing the array element spacing between the array element and the previous array element, i.e., obtaining the array element spacing D after the binary strings are restored;
when calculating positions of the previous J array elements, generating and counting each array element spacing D, and cumulatively calculating a value of an overall aperture, if the cumulative value of the array element spacing D exceeds a maximum aperture Da of the array, then mandatorily adjusting each array element spacing of the subsequent array elements to 1;
the adjustment method for the subsequent K array elements being the same as that for the previous J array elements.

4. The method for the array elements arrangement of the L-shaped array antenna based on the inheritance of the acquired character according to claim 3 , wherein the maximum aperture Da of the array is 55.

5. The method for the array elements arrangement of the L-shaped array antenna based on the inheritance of the acquired character according to claim 3 , wherein one adjustment of the population G k+1 is performed in step 4 after generating the new population G k+1 after one optimization operation, and the adjustment process is the same as the adjustment process in step 2.

6. The method for the a

Assignees

• Univ Dongguan Technology
• Li Yun
• Li Lin

Inventors

• Li Yun
• Li Lin

Classifications

• H01Q21/00 Primary

  Antenna arrays or systems (arrangements for changing or varying the orientation or the shape of the directional pattern of the waves radiated from an antenna or antenna system H01Q3/00) · CPC title

• G06N3/126 Primary

  Evolutionary algorithms, e.g. genetic algorithms or genetic programming · CPC title

• H01Q21/061 Primary

  Two dimensional planar arrays · CPC title