A Multi-objective Optimization Framework for the Design of a High Power-Density Switched Reluctance Motor
Bibliographic record
Abstract
Switched Reluctance Motors (SRMs) are reliable, robust, and magnet-free, but they have relatively lower power density, higher torque ripple and vibration. With the design and control optimization, the drawbacks of an SRM can be addressed. However, the relationship between geometry parameters and optimum control parameters can make the design of an SRM challenging. This paper proposes a multi-objective optimization framework for the design of a high-power density SRM. The proposed framework overcomes the challenges due to the motor geometry and current control interdependencies. It has two main stages. The first stage is the static optimization to find the geometries with high static average torque. The static optimization utilizes diverse non-linear surrogate models and global optimization algorithms to find a comprehensive set of geometries with high average static torque. In the second stage, for each of those geometries, the dynamic optimization loop is employed to improve the average torque, torque ripple, and radial forces. Dynamic optimization is a loop involving gradient-based deterministic optimization and stochastic controls optimization. The variations of geometry parameters in each iteration of the dynamic optimization is constrained to ensure the same control parameters can be maintained. The framework has been employed in the design of a high-power density SRM for an aerospace application. The same framework can be adapted for different SRM applications by modifying the constraints and objectives.
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.001 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".