Using FE Calculations and Data-Based System Identification Techniques to Model the Nonlinear Behavior of PMSMs

被引:45
作者
Bramerdorfer, Gerd [1 ]
Winkler, Stephan M. [2 ]
Kommenda, Michael [2 ]
Weidenholzer, Guenther [3 ]
Silber, Siegfried [1 ,4 ]
Kronberger, Gabriel [2 ]
Affenzeller, Michael [2 ]
Amrhein, Wolfgang [1 ]
机构
[1] Johannes Kepler Univ Linz, Inst Elect Drives & Power Elect, A-4040 Linz, Austria
[2] Univ Appl Sci Upper Austria, Heurist & Evolutionary Algorithms Lab, A-4232 Hagenberg, Austria
[3] Linz Ctr Mechatron GmbH, Dept Elect Drives & Actuat Syst, A-4040 Linz, Austria
[4] Linz Ctr Mechatron GmbH, A-4040 Linz, Austria
关键词
Artifical neural networks (ANNs); brushless machine; cogging torque; field-oriented control; genetic programming (GP); modeling; permanent magnet; random forests (RFRs); symbolic regression; torque ripple; MAGNETIC-FIELD DISTRIBUTION; FAULT-TOLERANT CONTROL; DC MOTORS; SYNCHRONOUS MACHINE; AIR-GAP; DRIVES; OPTIMIZATION; SIMULATION; DESIGN;
D O I
10.1109/TIE.2014.2303785
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper investigates the modeling of brushless permanent-magnet synchronous machines (PMSMs). The focus is on deriving an automatable process for obtaining dynamic motor models that take nonlinear effects, such as saturation, into account. The modeling is based on finite element (FE) simulations for different current vectors in the dq plane over a full electrical period. The parameters obtained are the stator flux in terms of the direct and quadrature components and the air-gap torque, both modeled as functions of the rotor angle and the current vector. The data are preprocessed according to theoretical results on potential harmonics in the targets as functions of the rotor angle. A variety of modeling strategies were explored: linear regression, support vector machines, symbolic regression using genetic programming, random forests, and artificial neural networks. The motor models were optimized for each training technique, and their accuracy was then compared based on the initially available FE data and further FE simulations for additional current vectors. Artificial neural networks and symbolic regression using genetic programming achieved the highest accuracy, particularly with additional test data.
引用
收藏
页码:6454 / 6462
页数:9
相关论文
共 58 条
  • [1] Affenzeller M, 2009, NUMER INSIGHT, pXXV
  • [2] Accurate Modeling and Performance Analysis of IPM-PMASR Motors
    Armando, Eric
    Guglielmi, Paolo
    Pellegrino, Gianmario
    Pastorelli, Michele
    Vagati, Alfredo
    [J]. IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS, 2009, 45 (01) : 123 - 130
  • [3] The artificial evolution of computer code
    Banzhaf, Wolfgang
    [J]. IEEE Intelligent Systems and Their Applications, 2000, 15 (03): : 74 - 76
  • [4] Modeling faulted switched reluctance motors using evolutionary neural networks
    Belfore, LA
    Arkadan, ARA
    [J]. IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 1997, 44 (02) : 226 - 233
  • [5] Commissioning of Electromechanical Conversion Models for High Dynamic PMSM Drives
    Bolognani, Silverio
    Peretti, Luca
    Zigliotto, Mauro
    Bertotto, Ezio
    [J]. IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2010, 57 (03) : 986 - 993
  • [6] Analytical Model of Slotted Air-Gap Surface Mounted Permanent-Magnet Synchronous Motor With Magnet Bars Magnetized in the Shifting Direction
    Boughrara, Kamel
    Chikouche, Brahim Ladghem
    Ibtiouen, Rachid
    Zarko, Damir
    Touhami, Omar
    [J]. IEEE TRANSACTIONS ON MAGNETICS, 2009, 45 (02) : 747 - 758
  • [7] Multiphysics Modeling of a Permanent Magnet Synchronous Machine by Using Lumped Models
    Bracikowski, Nicolas
    Hecquet, Michel
    Brochet, Pascal
    Shirinskii, Sergey V.
    [J]. IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2012, 59 (06) : 2426 - 2437
  • [8] Bramerdorfer G, 2013, 2013 IEEE INTERNATIONAL ELECTRIC MACHINES & DRIVES CONFERENCE (IEMDC), P1126
  • [9] Random forests
    Breiman, L
    [J]. MACHINE LEARNING, 2001, 45 (01) : 5 - 32
  • [10] Random forests
    Breiman, L
    [J]. MACHINE LEARNING, 2001, 45 (01) : 5 - 32