Cheap-expensive multi-objective Bayesian optimization for permanent magnet synchronous motor design

被引:1
作者
Loka, Nasrulloh [1 ]
Ibrahim, Mohamed [2 ,4 ,5 ]
Couckuyt, Ivo [1 ]
Van Nieuwenhuyse, Inneke [3 ]
Dhaene, Tom [1 ]
机构
[1] Ghent Univ imec, Dept Informat Technol INTEC, IDLab, iGent, Technol pk Zwijnaarde 126, B-9052 Ghent, Belgium
[2] Univ Ghent, Dept Electromech Syst & Met Engn, Technol pk Zwijnaarde 131, B-9052 Ghent, Belgium
[3] Hasselt Univ, FlandersMakeUHasselt & Data Sci Inst, Martelarenlaan 42, B-3500 Hasselt, Belgium
[4] FlandersMakeUGent Corelab MIRO, B-3001 Leuven, Belgium
[5] Kafrelshiekh Univ, Elect Engn Dept, Kafrelshiekh 33511, Egypt
关键词
Bayesian optimization; Multi-objectives optimization; Constrained optimization; Permanent magnet synchronous motor; IMPROVEMENT; ALGORITHM;
D O I
10.1007/s00366-023-01900-0
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Bayesian optimization (BO) is a popular optimization technique for expensive-to-evaluate black-box functions. We propose a cheap-expensive multi-objective BO strategy for optimizing a permanent magnet synchronous motor (PMSM). The design of an electric motor is a complex, time-consuming process that contains various heterogeneous objectives and constraints; in particular, we have a mix of cheap and expensive objective and constraint functions. The expensive objectives and constraints are usually quantified by a time-consuming finite element method, while the cheap ones are available as closed-form equations. We propose a BO policy that can accommodate cheap-expensive objectives and constraints, using a hypervolume-based acquisition function that combines expensive function approximation from a surrogate with direct cheap evaluations. The proposed method is benchmarked on multiple test functions with promising results, reaching competitive solutions much faster than traditional BO methods. To address the aforementioned design challenges for PMSM, we apply our proposed method, which aims to maximize motor efficiency while minimizing torque ripple and active mass, and considers six other performance indicators as constraints.
引用
收藏
页码:2143 / 2159
页数:17
相关论文
共 70 条
  • [1] Allmendinger R, 2021, ARXIV, DOI DOI 10.48550/ARXIV.2103.15546
  • [2] Multiobjective optimization: When objectives exhibit non-uniform latencies
    Allmendinger, Richard
    Handl, Julia
    Knowles, Joshua
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 243 (02) : 497 - 513
  • [3] Bergstra James, 2011, ADV NEURAL INFORM PR, V24, DOI DOI 10.5555/2986459.2986743
  • [4] Binh T.T., 1997, 3 INT C GENETIC ALGO, P176
  • [5] Pymoo: Multi-Objective Optimization in Python']Python
    Blank, Julian
    Deb, Kalyanmoy
    [J]. IEEE ACCESS, 2020, 8 : 89497 - 89509
  • [6] Buckingham JM, 2023, ARXIV
  • [7] Chankong V., 2008, MULTIOBJECTIVE DECIS
  • [8] Contal Emile, 2013, Machine Learning and Knowledge Discovery in Databases, P225
  • [9] Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization
    Couckuyt, Ivo
    Deschrijver, Dirk
    Dhaene, Tom
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2014, 60 (03) : 575 - 594
  • [10] Daulton S., 2020, ADV NEURAL INFORM PR, V33, P9851, DOI [DOI 10.48550/ARXIV.2006.05078, 10.48550/arXiv.2006.05078]