Proceedings of IEEE Antennas and Propagation Society International Symposium and URSI National Radio Science Meeting
DOI: 10.1109/aps.1994.407697
|View full text |Cite
|
Sign up to set email alerts
|

Determining the excitation coefficients of an array using genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 38 publications
(11 citation statements)
references
References 0 publications
0
11
0
Order By: Relevance
“…Whether the search is deterministic or stochastic, it is possible to improve the reliability of the results. GA's are stochastic search mechanisms that utilize a Darwinian criterion of population evolution [12]- [14]. The GA has robustness that allows its structural functionality to be applied to many different search problems This effectively means that once the search variables are encoded into a suitable format, the GA scheme can be applied in many environments.…”
Section: Implementation Procedures Of Genetic Algorithmmentioning
confidence: 99%
“…Whether the search is deterministic or stochastic, it is possible to improve the reliability of the results. GA's are stochastic search mechanisms that utilize a Darwinian criterion of population evolution [12]- [14]. The GA has robustness that allows its structural functionality to be applied to many different search problems This effectively means that once the search variables are encoded into a suitable format, the GA scheme can be applied in many environments.…”
Section: Implementation Procedures Of Genetic Algorithmmentioning
confidence: 99%
“…Evolutionary algorithms such as genetic algorithm [2,3], particle swarm optimization [4] have been successfully applied in the synthesis of array antenna. The authors [5] applied genetic algorithm for design of fully digital controlled reconfigurable array antenna.…”
Section: Introductionmentioning
confidence: 99%
“…Studies have been done on GA-based methods of reducing the sidelobes of an array, amplitude tapering or element position perturbation, planar array synthesis, etc. [4][5][6][7]. Particle swarm optimization is a recently invented high-performance optimizer that possesses several highly desirable attributes.…”
Section: Introductionmentioning
confidence: 99%