Advanced Design Optimization of Switched Reluctance Motors for Torque Improvement Using Supervised Learning Algorithm
Bibliographic record
Abstract
Existing research on geometry optimization of switched reluctance motor (SRM) using machine learning algorithms has focused only on the machine’s static characteristics. The dynamic characteristics, however, are critical to improve the SRM performance, particularly at high speeds. This paper introduces an advanced optimization method utilizing a supervised learning algorithm to act as a surrogate model for both static and dynamic characteristics of the SRM. In this work, back-propagation neural network (BPNN) is applied to map out the SRM geometrical parameters, stator and rotor pole arc angles and their dynamic performance metrics such as average torque and torque ripples. To capture the training data, finite element analysis (FEA) and MATLAB Simulink models are implemented to study the static and dynamic characteristics of the considered 6/14 SRM. Levenberg-Marquardt is applied to train the BPNN. The results of the proposed optimal design candidates are verified using FEA and MATLAB simulations, confirming the effectiveness of the optimal design. The optimal design improves the average torque by around 2% and reduces the torque ripples by around 24%. Moreover, the proposed method significantly decreases the computational overhead.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".