Non-periodic and Conformal Antenna Arrays Design Using Parallel Evolutionary Algorithm Based on GA and PSO

Constrained Deterministic Synthesis of Conformal Supershaped Antenna Arrays

“…Please note that the angular difference is dependent on the initial position i (q), thus making the direct evaluation of the integral in (20) challenging in general. The expression (q) can be evaluated through numerical techniques by solving where d S is the arclength integrant from (6). Similarly, (22) only has an analytical solution for circles and reduces to Elliptic integrals in the case of elliptical contours.…”

“…The complexity of conformal array synthesis gives rise to a multidimensional and nonlinear problem due to the large number of unknowns and many local optima. This has encouraged the application of metaheuristics such as the genetic algorithms (GAs), particle swarm optimization (PSO), simulated annealing (SA), differential evolution (DE), and grasshopper optimization algorithm (GOA) [6], [7], [8], [9], [10], [11], [12], [13]. Such techniques have been proven useful in order to incorporate active element patterns, enforce minimal element spacing, or deal with arbitrary geometries.…”

Synthesis of Elliptically Shaped Aperiodic Antenna Arrays Subject to Complex Design Constraints

“…Due to this complexity, the synthesis process becomes multidimensional and nonlinear, with a large number of unknowns and many local optima. This complexity has encouraged the use of metaheuristics such as genetic algorithms (Dubovitskiy & Mikhailov, 2022;Liang et al, 2018), particle swarm optimizers (Bai et al, 2013;Li et al, 2018), simulated annealing (Xie et al, 2009), differential evolution (Ahn et al, 2022), and grasshopper optimization algorithm (Amaireh et al, 2022). However, such optimization processes still exhibit a reduced convergence speed, which can lead to considerable computational cost (Li et al, 2018;Pinchera et al, 2018).…”