In this paper, a multi-objective approach is applied to the design of aperiodic linear arrays of antennas. The adopted procedure is based on a standard Matlab implementation of the Controlled Elitist Non-Dominated Sorting Genetic Algorithm II. Broadside symmetrical arrays of isotropic radiators are considered with both uniform and non-uniform excitations. The work focuses on whether, and in which design conditions, the aperiodic solutions obtained by the adopted standard multi-objective evolutionary procedure can approximate or outperform the Pareto-optimal front for the uniformspacing case computable by the Dolph-Chebyshev method.
Multi-objective evolutionary optimization of aperiodic symmetrical linear arrays / Napoli, Francesco; Pajewski, Lara; Vescovo, Roberto; Marciniak, Marian. - In: JOURNAL OF TELECOMMUNICATIONS AND INFORMATION TECHNOLOGY. - ISSN 1509-4553. - STAMPA. - 2017:3(2017), pp. 79-87. [10.26636/jtit.2017.118517]
Multi-objective evolutionary optimization of aperiodic symmetrical linear arrays
Pajewski, Lara
;
2017
Abstract
In this paper, a multi-objective approach is applied to the design of aperiodic linear arrays of antennas. The adopted procedure is based on a standard Matlab implementation of the Controlled Elitist Non-Dominated Sorting Genetic Algorithm II. Broadside symmetrical arrays of isotropic radiators are considered with both uniform and non-uniform excitations. The work focuses on whether, and in which design conditions, the aperiodic solutions obtained by the adopted standard multi-objective evolutionary procedure can approximate or outperform the Pareto-optimal front for the uniformspacing case computable by the Dolph-Chebyshev method.File | Dimensione | Formato | |
---|---|---|---|
Napoli_Multi-objective_2017.pdf
accesso aperto
Note: https://www.itl.waw.pl/czasopisma/JTIT/2017/3/79.pdf
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Creative commons
Dimensione
2.61 MB
Formato
Adobe PDF
|
2.61 MB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.