A Computer-Aided Design Process for Optimizing the Size of Inverter-Fed Permanent Magnet Motors
Bibliographic record
Abstract
A process for designing an inverter-fed motor while taking into account the performance of the inverter is proposed. To draw a comparison, the classical approach to machine sizing is discussed and its shortcomings in achieving a more optimal solution to the motor-drive system design problem are pointed out. The results prove that designing the motor as an independent system may give less optimal solutions compared to the case where an integrated system is considered. Therefore, the machines and the inverters should be designed simultaneously. An inverter-fed interior permanent magnet motor is investigated, and the corresponding design guidelines are presented. These guidelines are based on the knowledge extracted from an inclusively modeled, sampled, and simulated design space. The reliability of the design, the inverter efficiency, and the priorities of the transient, rated and flux weakening operations are assigned as the selection criteria. Moreover, various user-package interfaces are proposed to show how the designer should be guided towards a more realistic design choice. Finally, four different design cases are presented and compared to the output of the classical machine sizing process. The proposed approach serves as a proposal for the next generation of processes implemented with the aid of a high-performance cloud-computing service.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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".