The design optimization of IPM motors for wide speed ranges is considered in this paper by means of a FEA-based multi-objective genetic algorithm (MOGA). The minimum number of simulations is pursued for the fast evaluation of four goal functions: maximum torque, minimum torque ripple, maximum flux weakening capability and minimum rotor harmonic losses. The paper is focused on the rotor design, that is the most controversial aspect of IPM design due to the difficult modeling dominated by magnetic saturation. Three original results are presented: the elimination of higher order torque ripple harmonics and the minimization of FEA evaluations by means of a random rotor position offset and the evaluation, by means of the same static FEA runs, of the eddy current losses in the rotor core
FEA-based multi-objective optimization of IPM motor design including rotor losses / Pellegrino, G.; Cupertino, Francesco. - (2010), pp. 3659-3666. (Intervento presentato al convegno 2nd IEEE Energy Conversion Congress and Exposition, ECCE 2010 tenutosi a Atlanta, GA nel September 12-16, 2010) [10.1109/ECCE.2010.5618310].
FEA-based multi-objective optimization of IPM motor design including rotor losses
CUPERTINO, Francesco
2010-01-01
Abstract
The design optimization of IPM motors for wide speed ranges is considered in this paper by means of a FEA-based multi-objective genetic algorithm (MOGA). The minimum number of simulations is pursued for the fast evaluation of four goal functions: maximum torque, minimum torque ripple, maximum flux weakening capability and minimum rotor harmonic losses. The paper is focused on the rotor design, that is the most controversial aspect of IPM design due to the difficult modeling dominated by magnetic saturation. Three original results are presented: the elimination of higher order torque ripple harmonics and the minimization of FEA evaluations by means of a random rotor position offset and the evaluation, by means of the same static FEA runs, of the eddy current losses in the rotor coreI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.