Main Content

Antenna and Array Optimization Algorithms

Surrogate model assisted differential evolution for antenna synthesis (SADEA) is an artificial intelligence (AI) driven antenna design method. It is based on machine learning and evolutionary computation techniques, with the advantages of optimization quality, efficiency, generality and robustness. SADEA carries out global optimization and employs a surrogate model built by statistical learning techniques The method to make surrogate modeling and optimization work harmoniously is critical in such surrogate model-assisted optimization methods. In SADEA, some ideas of the surrogate model-aware evolutionary search framework are borrowed, see [3] and [4].

SADEA uses differential evolution (DE) as the search engine and Gaussian process (GP) machine learning as the surrogate modeling method. For more information, please see [1].

TR-SADEA is an enhanced version of the SADEA algorithm designed to further reduce the computational cost associated with the training of surrogate models. This variant aims to optimize the balance between the accuracy of the surrogate model and the computational resources required for its training. By minimizing the number of training samples and optimizing the surrogate model updates, TR-SADEA significantly lowers the overall computational expense. Adaptive sampling ensures that computational resources are directed towards the most promising regions of the search space. Despite the reduced training cost, TR-SADEA maintains high optimization accuracy by strategically managing the surrogate model.

TR-SADEA is particularly suitable for applications where the evaluation of the objective function is computationally expensive. For more information on TR-SADEA, see [6].

Algorithm Outline

Initialization

Use the Latin Hypercube sampling (LHS) to generate α design samples from [a,b]d, evaluate all the design samples using EM simulations and then use them to form the initial database. [a,b]d is the search range defined by the user. The value of α is determined self-adaptively.

Iteration steps

  • Select the λ best candidate designs from the database to form a population P. Update the best candidate design obtained so far. The value of λ is determined self-adaptively.

  • Apply the differential evolution current-to-best/1 mutation and binomial crossover operators on P to generate λ child solutions.

  • For each child solution in P, select τ nearest design samples (based on Euclidean distance) as the training data points and construct a local Gaussian process surrogate model. The value of τ is determined self-adaptively.

  • Prescreen the λ child solutions generated before by using the Gaussian process surrogate model with the lower confidence bound prescreening.

  • Carry out an EM simulation to the prescreened best child solution, add this simulated candidate design and its function value to the database.

Stopping criteria

  • The specification(s) is (are) met.

  • The standard deviation of the population is smaller than a threshold and the current best objective function value does not improve for a certain number of iterations. (It is better to be controlled using the figure displaying the convergence trend).

  • The computing budget (the number of EM simulations) is exhausted. Note that the number of EM simulations can be added anytime.

References

[1] Liu, Bo, Hadi Aliakbarian, Zhongkun Ma, Guy A. E. Vandenbosch, Georges Gielen, and Peter Excell. “An Efficient Method for Antenna Design Optimization Based on Evolutionary Computation and Machine Learning Techniques.” IEEE Transactions on Antennas and Propagation 62, no. 1 (January 2014): 7–18. https://doi.org/10.1109/TAP.2013.2283605.

[2] Liu, Bo, Alexander Irvine, Mobayode O. Akinsolu, Omer Arabi, Vic Grout, and Nazar Ali. “GUI Design Exploration Software for Microwave Antennas.” Journal of Computational Design and Engineering 4, no. 4 (October 2017): 274–81. https://doi.org/10.1016/j.jcde.2017.04.001.

[3] Liu, Bo, Qingfu Zhang, and Georges G. E. Gielen. “A Gaussian Process Surrogate Model Assisted Evolutionary Algorithm for Medium Scale Expensive Optimization Problems.” IEEE Transactions on Evolutionary Computation 18, no. 2 (April 2014): 180–92. https://doi.org/10.1109/TEVC.2013.2248012.

[4] Liu, Bo, Qingfu Zhang, Georges G. E. Gielen, A.Karkar, A.Yakovlev, V.Grout. “SMAS: A Generalized and Efficient Framework for Computationally Expensive Electronic Design Optimization Problems.” Computational Intelligence in Electronic Design, Springer, 2015.

[5] Grout, Vic, Mobayode O. Akinsolu, Bo Liu, Pavlos I. Lazaridis, Keyur K. Mistry, and Zaharias D. Zaharis. “Software Solutions for Antenna Design Exploration: A Comparison of Packages, Tools, Techniques, and Algorithms for Various Design Challenges.” IEEE Antennas and Propagation Magazine 61, no. 3 (June 2019): 48–59. https://doi.org/10.1109/MAP.2019.2907887.

[6] Liu, Bo, Mobayode O. Akinsolu, Chaoyun Song, Qiang Hua, Peter Excell, Qian Xu, Yi Huang, and Muhammad Ali Imran. “An Efficient Method for Complex Antenna Design Based on a Self Adaptive Surrogate Model-Assisted Optimization Technique.” IEEE Transactions on Antennas and Propagation 69, no. 4 (April 2021): 2302–15. https://doi.org/10.1109/TAP.2021.3051034.

See Also

|