On Accurate Discrete-Time Dynamic Models of an Induction Machine

Ramón Herrera Hernández, Carlos Reusser (), María Coronel and Rodrigo Carvajal
Additional contact information
Ramón Herrera Hernández: School of Electrical Engineering, Pontificia Universidad Católica de Valparaíso (PUCV), Av. Brasil 2147, Valparaíso 2362804, Chile
Carlos Reusser: School of Electrical Engineering, Pontificia Universidad Católica de Valparaíso (PUCV), Av. Brasil 2147, Valparaíso 2362804, Chile
María Coronel: Department of Electricity, Universidad Tecnológica Metropolitana (UTEM), Av. Jose Pedro Alessandri 1242, Santiago 7800002, Chile
Rodrigo Carvajal: School of Electrical Engineering, Pontificia Universidad Católica de Valparaíso (PUCV), Av. Brasil 2147, Valparaíso 2362804, Chile

Mathematics, 2024, vol. 12, issue 3, 1-23

Abstract: Induction machines have become the standard for highly demanding industrial applications. This has led to the utilization of modern discrete-time control techniques (such as model predictive control) that require the estimation of internal variables that are not subject to measurement (such as the rotational velocity in sensorless applications). From this point of view, it is fundamental to have accurate discrete-time models of induction machines, particularly given their nonlinear nature, so that control techniques perform according to design requirements. In spite of the above, the modeling of induction machines has not received much attention in the literature, even though more powerful machines and faster microcontrollers are currently being used. To better understand induction machine models for control, in this paper, we develop and compare various discrete-time models of induction machines based on Euler, Taylor, and Runge–Kutta methods. In addition, we compare the Extended Kalman Filter and Unscented Kalman Filter for state estimation in terms of accuracy and computational burden. The models are derived and compared through extensive Monte Carlo simulations and the state estimation techniques are compared in terms of root mean squared error, execution time, and maximum absolute error. Our simulations show that, in general, the Taylor method yields more accurate models than both the Runge–Kutta and Euler methods. In particular, the Taylor method results in a root mean square error that is one order of magnitude smaller than the Euler method for stator current and rotor flux linkages. For rotor angular speed, the Runge–Kutta methods are more accurate than both the Taylor and Euler methods, resulting in a root mean square error that is two orders of magnitude smaller than the Euler method. On the other hand, the Extended Kalman Filter results in smaller execution time than the Unscented Kalman Filter, up to two orders of magnitude. In terms of root mean squared error and maximum absolute error, both filtering algorithms perform similarly.

Keywords: induction machine; Bayesian filtering; discretization (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/3/373/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/3/373/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:3:p:373-:d:1325516

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().