z-logo
open-access-imgOpen Access
Search controller‐based online efficiency optimisation strategy for induction motor drives using modified adaptive quadratic interpolation
Author(s) -
Pal Abhisek,
Das Sukanta
Publication year - 2020
Publication title -
iet power electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.637
H-Index - 77
eISSN - 1755-4543
pISSN - 1755-4535
DOI - 10.1049/iet-pel.2020.0206
Subject(s) - induction motor , control theory (sociology) , stator , interpolation (computer graphics) , computer science , controller (irrigation) , vector control , matlab , control engineering , convergence (economics) , engineering , control (management) , artificial intelligence , voltage , economic growth , economics , mechanical engineering , motion (physics) , agronomy , operating system , electrical engineering , biology
A search control‐based new efficiency optimisation strategy for indirect vector controlled induction motor (IM) drive is proposed in this work. The online optimisation method considered in this regard is based on modified adaptive quadratic interpolation. The proposed strategy is employed in the flux loop of the speed control technique to decide the optimum flux component of stator current necessary to meet a particular drive operating condition. The selection of the optimum flux in this way, in fact, minimises the core loss of IM drive, thereby improving the overall efficiency of the drive depending upon the motor loading condition. Like the conventional search controllers, the algorithm is simple, immune to the machine parameter variation and does not require any additional circuitry for its implementation. The algorithm offers faster convergence, thereby preserving the dynamic response of the speed control loop. Analytical studies are done in MATLAB/Simulink and the results are validated experimentally in a 2.2 kW IM drive laboratory prototype.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here