Vision, Challenges, and Future Trends of Model Predictive Control in Switched Reluctance Motor Drives
Bibliographic record
Abstract
Switched Reluctance Motors (SRMs) have become a popular alternative to replace permanent magnet machines in high-performance emerging applications such as automotive and aerospace. However, its market attractiveness is limited by the difficulty in control given its nonlinear behaviour. Model predictive control (MPC) is a promising solution to deal with this problem as per its notable features to deal with complex systems, nonlinearities and constraints. Still, the applications in SRMs are at an early stage compared to other drives. This paper aims to discuss the recent advancements and challenges in MPC for SRMs and a vision of its future developments and applications. The article describes the main difficulties in SRM control and the different approaches adopted to date by MPC to solve them. It also analyzes the control objectives that should still be considered in SRM drives, their particular challenges and how recent MPC developments in other AC drives can be adapted to the SRM case. The paper then proposes a roadmap of future works to achieve a unified and reliable control strategy that boosts SRM to outperform other drives, relating the control objectives to its potential applications.
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.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.003 |
| 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".