EM-Driven Multi-Objective Optimization of a Generic Monopole Antenna by Means of a Nested Trust-Region Algorithm

Antenna structures for modern applications are characterized by complex and unintuitive topologies that are difficult to develop when conventional, experience-driven techniques are of use. In this work, a method for the automatic generation of antenna geometries in a multi-objective setup has been p...

Full description

Saved in:
Bibliographic Details
Published inApplied sciences Vol. 11; no. 9; p. 3958
Main Authors Bekasiewicz, Adrian, Koziel, Slawomir, Plotka, Piotr, Zwolski, Krzysztof
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.05.2021
Subjects
Online AccessGet full text
ISSN2076-3417
2076-3417
DOI10.3390/app11093958

Cover

More Information
Summary:Antenna structures for modern applications are characterized by complex and unintuitive topologies that are difficult to develop when conventional, experience-driven techniques are of use. In this work, a method for the automatic generation of antenna geometries in a multi-objective setup has been proposed. The approach involves optimization of a generic spline-based radiator with an adjustable number of parameters using a nested, trust region-based algorithm. The latter iteratively increases the dimensionality of the radiator in order to gradually improve its performance. The method has been used to generate a set of nine antenna designs, representing a trade-off between minimization of reflection within 3.1 GHz to 10.6 GHz and a reduction of size. The properties of the optimized designs vary along the Pareto set from −10 dB to −20 dB and from 230 mm2 to 757 mm2 for the first and second objectives, respectively. The presented design approach has been validated against a genuine, population-based optimization routine. Furthermore, the smallest Pareto-optimal design has been compared to the antennas from the literature.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2076-3417
2076-3417
DOI:10.3390/app11093958