Search
Low-Cost Multi-Objective Optimization of Antennas By Means Of Generalized Pareto Ranking Bisection Algorithm
Abstract
This paper introduces a generalized Pareto ranking bisection algorithm for low-cost multi-objective design optimization of antenna structures. The algorithm allows for identifying a set of Pareto optimal sets of parameters (that represent the best trade-offs between considered objectives) by iterative partitioning of the intervals connecting previously found designs and executing a Pareto-ranking-based poll search. The initial approximation of the Pareto front found using the bisection procedure is subsequently refined to the level of the high-fidelity EM model of the antenna at hand using local optimization. A serious limitation of the original bisection algorithm was that only two objectives could be considered. The generalized version proposed here allows for handling any number of design goals. An improved poll search procedure has also been developed and incorporated. Our algorithm has been demonstrated using an example of a UWB monopole antenna with three figures of interest taken into account: structure size, reflection response, and gain variability.
Citations
-
0
CrossRef
-
0
Web of Science
-
0
Scopus
Authors (2)
-
S Unnsteinsson
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Conference activity
- Type:
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Title of issue:
- 12th European Conference on Antennas and Propagation (EuCAP 2018) strony 730 - 734
- Language:
- English
- Publication year:
- 2018
- Bibliographic description:
- Unnsteinsson S., Kozieł S.: Low-Cost Multi-Objective Optimization of Antennas By Means Of Generalized Pareto Ranking Bisection Algorithm// 12th European Conference on Antennas and Propagation (EuCAP 2018)/ : , 2018, s.730-734
- DOI:
- Digital Object Identifier (open in new tab) 10.1049/cp.2018.1089
- Verified by:
- Gdańsk University of Technology
seen 92 times