LAPSE:2023.5066v1
Published Article

LAPSE:2023.5066v1
Optimal Design of IPMSM for EV Using Subdivided Kriging Multi-Objective Optimization
February 23, 2023
Abstract
In this paper, subdivided kriging multi-objective optimization (SKMOO) is proposed for the optimal design of interior permanent magnet synchronous motor (IPMSM). The SKMOO with surrogate kriging model can obtain a uniform and accurate pareto front set with a reduced computation cost compared to conventional algorithms which directly adds the solution in the objective function area. In other words, the proposed algorithm uses a kriging surrogate model, so it is possible to know which design variables have the value of the objective function on the blank space. Therefore, the solution can be added directly in the objective function area. In the SKMOO algorithm, a non-dominated sorting method is used to find the pareto front set and the fill blank method is applied to prevent premature convergence. In addition, the subdivided kriging grid is proposed to make a well-distributed and more precise pareto front set. Superior performance of the SKMOO is confirmed by compared conventional multi objective optimization (MOO) algorithms with test functions and are applied to the optimal design of IPMSM for electric vehicle.
In this paper, subdivided kriging multi-objective optimization (SKMOO) is proposed for the optimal design of interior permanent magnet synchronous motor (IPMSM). The SKMOO with surrogate kriging model can obtain a uniform and accurate pareto front set with a reduced computation cost compared to conventional algorithms which directly adds the solution in the objective function area. In other words, the proposed algorithm uses a kriging surrogate model, so it is possible to know which design variables have the value of the objective function on the blank space. Therefore, the solution can be added directly in the objective function area. In the SKMOO algorithm, a non-dominated sorting method is used to find the pareto front set and the fill blank method is applied to prevent premature convergence. In addition, the subdivided kriging grid is proposed to make a well-distributed and more precise pareto front set. Superior performance of the SKMOO is confirmed by compared conventional multi objective optimization (MOO) algorithms with test functions and are applied to the optimal design of IPMSM for electric vehicle.
Record ID
Keywords
electric vehicle, fill blank, interior permanent magnet synchronous motor, kriging, multi-objective optimization
Subject
Suggested Citation
Ahn JM, Baek MK, Park SH, Lim DK. Optimal Design of IPMSM for EV Using Subdivided Kriging Multi-Objective Optimization. (2023). LAPSE:2023.5066v1
Author Affiliations
Ahn JM: Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan 44610, Korea [ORCID]
Baek MK: Korea Electrotechnology Research Institute, Changwon-si 51543, Korea
Park SH: Korea Electrotechnology Research Institute, Changwon-si 51543, Korea
Lim DK: Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan 44610, Korea
Baek MK: Korea Electrotechnology Research Institute, Changwon-si 51543, Korea
Park SH: Korea Electrotechnology Research Institute, Changwon-si 51543, Korea
Lim DK: Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan 44610, Korea
Journal Name
Processes
Volume
9
Issue
9
First Page
1490
Year
2021
Publication Date
2021-08-24
ISSN
2227-9717
Version Comments
Original Submission
Other Meta
PII: pr9091490, Publication Type: Journal Article
Record Map
Published Article

LAPSE:2023.5066v1
This Record
External Link

https://doi.org/10.3390/pr9091490
Publisher Version
Download
Meta
Record Statistics
Record Views
254
Version History
[v1] (Original Submission)
Feb 23, 2023
Verified by curator on
Feb 23, 2023
This Version Number
v1
Citations
Most Recent
This Version
URL Here
https://psecommunity.org/LAPSE:2023.5066v1
Record Owner
Auto Uploader for LAPSE
Links to Related Works
(0.36 seconds) 0.01 + 0.02 + 0.18 + 0.07 + 0 + 0.03 + 0.01 + 0 + 0.01 + 0.03 + 0 + 0
