2020
DOI: 10.1155/2020/9483971
|View full text |Cite
|
Sign up to set email alerts
|

A Modified Wolf Pack Algorithm for Multiconstrained Sparse Linear Array Synthesis

Abstract: The aim of the research is to propose a new optimization method for the multiconstrained optimization of sparse linear arrays (including the constraints of the number of elements, the aperture of arrays, and the minimum distance between adjacent elements). The new method is a modified wolf pack optimization algorithm based on the quantum theory. In the new method, wolves are coded by Bloch spherical coordinates of quantum bits, updated by quantum revolving gates, and selectively adaptively mutated when perform… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 22 publications
0
6
0
Order By: Relevance
“…However, there is a problem that the wolf pack algorithm is not easy to break away the local solution, so that the cluster center point may not be optimal. In the three search stages of the implementation of the wolf pack algorithm, there are problems such as slow convergence, easy to fall into the local optimum, and unsatisfactory interaction of artificial wolves [13]. Therefore, this paper proposes the improved wolf pack algorithm based on the search strategy.…”
Section: K-means Algorithm Based On Improved Wpamentioning
confidence: 99%
“…However, there is a problem that the wolf pack algorithm is not easy to break away the local solution, so that the cluster center point may not be optimal. In the three search stages of the implementation of the wolf pack algorithm, there are problems such as slow convergence, easy to fall into the local optimum, and unsatisfactory interaction of artificial wolves [13]. Therefore, this paper proposes the improved wolf pack algorithm based on the search strategy.…”
Section: K-means Algorithm Based On Improved Wpamentioning
confidence: 99%
“…A multi-constraint optimization problem is formulated for the sparse LAA to reduce the effect of mutual coupling between the element and keep a narrow main lobe width [10]. In this paper, the multi-constraint synthesis problem imposes a constraint on the minimum inter-element spacing, aperture length with null placement.…”
Section: (4) Case 4: Minimization Of the Peak Sll With Constraint On The Minimum Inter-element Spacing Aperture Length And Null Controlmentioning
confidence: 99%
“…It abases the performance of the designed antenna array [8]. However, attempts are been made by researchers to reduce the effect of mutual coupling among the array elements by altering the element position and aperture length [9] [10]. A few researchers have also employed the idea of reducing mutual coupling by minimizing the driving admittance of each identical array element and including this concept in their cost function definition [8] [11].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Artificial bee colony algorithm (ABC) is a heuristic search technology based on swarm intelligence, which can mimic the foraging behavior of bees. Due to its advantages of few control parameters and strong global search ability, it is widely used in many fields, such as training neural networks [17], data clustering [18], business travel problems [19], and engineering optimization [20].…”
Section: Introductionmentioning
confidence: 99%