Model-Free Predictive Current Control for Switched Reluctance Motor Drives Using Current Difference Technique
Bibliographic record
Abstract
This article proposes a new current control for switched reluctance motor (SRM) drives. The proposed method is based on the principles of model-free predictive control. Therefore, it eliminates the need for offline analysis to determine motor parameters and their storage in memory. The controller utilizes a current difference technique to store the measured values of current changes at each controller sampling time, during motor operation. These stored values of current difference are then mapped to their corresponding duty cycles and used to update a look-up table, aiding the decision making process of the cost function. The current difference table is memory-friendly and does not require additional current sampling, making this approach desirable for low-cost applications. An update mechanism for the table has been proposed to ensure fast update with minimal error while maintaining simplicity. Simulation results and experiments demonstrate that this fixed-switching control method can operate effectively over a wide speed range, even under the inductance saturation and induced back-EMF conditions. Additionally, the results indicate superior performance of the controller compared with different current controllers in the literature such as proportional-integral, model-based, and model-free predictive control methods in terms of low current ripple and low current root mean square error.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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".