Skip to content
naulon

Not checkedNot checked for notices yet.

Model reference adaptive backstepping control of double star induction machine with extended Kalman sensorless control

H. Chaabane, D. E. Khodja, S. Chakroune and 1 more

Electrical engineering & Electromechanics · 2022

doi:10.20998/2074-272x.2022.4.01 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Introduction. Newly, the design of a controller for speed control of double star induction motor as a research focus. Consequently, backstepping technique is used to recursively construct a stable control law for speed and flux. Nevertheless, this control law coming from backstepping requires the knowledge of speed and flux values; in practice the measurement sensors are expensive and fragile. The novelty of this work consists to propose a control strategy which based on accurate Kalman filter observer that estimates speed, flux and torque. This extended Kalman filter is an optimal state estimator and is usually applied to a dynamic system that involves a random noise environment. Purpose. Apply a backstepping control of double star induction motor based on principle of rotor flux orientation. This approach consists in finding a Lyapunov function that allows deducing a control law and a modified adaptation rule is referred and sufficient conditions for the stability of the command-observer, in contrast to other techniques who use nonlinear principle. Results. The simulation results are shown to illustrate the performance of the proposed scheme under parametric uncertainties by simulation on MATLAB. The obtained results showed the robustness of the sensorless control in front of load and parameters variation of double stator induction motor. The research directions of the model were determined for the subsequent implementation of results with simulation samples.

Abstract licence: CC BY-NC

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.