Dynamic programming applied to unequally spaced arrays

On the radiation properties of ADS-thinned dipole arrays

“…The periodic nature of the arising layouts also enables an easier construction compared to other nonregular arrangements such as aperiodic structures [1]. Also for these reasons, array thinning has been deeply investigated and several methodologies have been proposed ranging from dynamic programming [3], random approaches [4,5], as well as stochastic tools based on genetic algorithms [1,6,7,8,9,10,11,12,13], simulated annealing [14], particle swarm optimizations [15,16,17], and pattern search [18]. Although very effective, these methodologies exhibit some drawbacks either in terms of PSL control (specifically, random layouts) or computational costs (namely, stochastic optimization-based techniques) especially when large layouts are at hand.…”

Deployment of the meta heuristic Colonial Competitive Algorithm in synthesis of unequally spaced linear antenna array

“…In [4] the density of elements located within a given array length is made proportional to the amplitude distribution of the conventional equally-spaced array. Mailloux et al used statistical thinning of arrays with quantized element weights to reduce the SLL considerably in large circular arrays [5].…”

Pattern Synthesis using Genetic Algorithm for Low Sidelobe Levels

“…Such methods are easily extendable to linear, non linear, circular and elliptical arrays etc. These methods include linear optimization methods, non linear optimization, adaptive methods [8][9] dynamic programming [10], downhill, Powell's, conjugate gradient and genetic algorithm etc. Although, most of the above methods are widely applied, simulated annealing, GA [11][12][13] has the characteristics of universal technique.…”