Estimation of the Double-Cage Model for Three-Phase Induction Machines Using Decision Tree-Based Algorithms

This paper presents a novel methodology for estimating the Double-Cage Model (DCM) for Three-Phase Induction Machines (TIMs) using decision tree-based algorithms. Validated on a diverse dataset of 860 machines spanning a power range from 0.12 kW to 370 kW, the proposed method stands out by requiring fewer input parameters than traditional techniques like the modified Newton method. Moreover, the proposed approach remains effective even when the input data exhibits statistical deviations, a common challenge in practical scenarios. The main contributions of this work are the reduction of the number of parameters necessary for the estimation of the DCM equivalent circuit and employing three distinct decision tree-based algorithms, whose effectiveness was confirmed through simulations and experimental tests, thereby providing an accurate representation of the dynamics of real TIMs. The results indicate that by using only basic and readily available data from machine nameplates, such as nominal current, power, speed, voltage, and torque, the proposed methodology provides a reliable and efficient framework for incorporating the real dynamics of TIMs into computational models.

Authors

Institutions

Publication Details

Journal
IEEE Open Journal of the Industrial Electronics Society
Published
2025-01-01
DOI
https://doi.org/10.1109/ojies.2025.3572372
Primary Topic
Magnetic Properties and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Estimation of the Double-Cage Model for Three-Phase Induction Machines Using Decision Tree-Based Algorithms

Rafael dos Santos, Helmo Kelis Morales Paredes, Marcelo Godoy Simões, Eduardo Infante de Oliveira
IEEE Open Journal of the Industrial Electronics Society
Magnetic Properties and Applications
article

Estimation of the Double-Cage Model for Three-Phase Induction Machines Using Decision Tree-Based Algorithms

Rafael dos Santos, Helmo Kelis Morales Paredes, Marcelo Godoy Simões, Eduardo Infante de Oliveira
article en

Abstract

This paper presents a novel methodology for estimating the Double-Cage Model (DCM) for Three-Phase Induction Machines (TIMs) using decision tree-based algorithms. Validated on a diverse dataset of 860 machines spanning a power range from 0.12 kW to 370 kW, the proposed method stands out by requiring fewer input parameters than traditional techniques like the modified Newton method. Moreover, the proposed approach remains effective even when the input data exhibits statistical deviations, a common challenge in practical scenarios. The main contributions of this work are the reduction of the number of parameters necessary for the estimation of the DCM equivalent circuit and employing three distinct decision tree-based algorithms, whose effectiveness was confirmed through simulations and experimental tests, thereby providing an accurate representation of the dynamics of real TIMs. The results indicate that by using only basic and readily available data from machine nameplates, such as nominal current, power, speed, voltage, and torque, the proposed methodology provides a reliable and efficient framework for incorporating the real dynamics of TIMs into computational models.

IEEE Open Journal of the Industrial Electronics SocietyVol. 6
Universidade de Sorocaba (BR), University of Vaasa (FI), Universidade Estadual Paulista (Unesp) (BR)
Peace, Justice and strong institutions
Openalex Percentile: Top 94%
Magnetic Properties and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.