Comprehensive Drive of PM Synchronous Machines Under Unpredictable Dynamics
Bibliographic record
Abstract
This research is dedicated to the design of Comprehensive control for permanent magnet synchronous machines (PMSMs) that have unpredictable system transient. In field-oriented control, the traditional method employs conventional proportional-integral (PI) controllers to regulate the PMSM's rotor speed and dq-axis currents. The paper introduces two control methods: conventional field-oriented control (FOC) and simplified technique. The initial step involves determining the control coefficients for multiple PMSMs with different power ratings through an empirical study, while power ratings are easily available on all the motors' nameplates which makes it simple to directly calculate the control coefficients. Each of these coefficients is then represented using generalized mathematical formulas. In FOC, the control coefficients are determined solely based on the machine power ratings. In contrast, the simplified technique obtains generalized expressions for control coefficients using the number of pole pairs and the flux linkage. Compared to FOC, the simplified technique offers significantly simpler generalized mathematical expressions. To validate the effectiveness of the proposed approach, validation is conducted in the MATLAB/Simulink environment utilizing various PMSMs ranging from$\mathbf{0.2}HP$to$\mathbf{10}HP$. The results demonstrate precise tracking of the reference speed and dq-axis reference currents. Hence, the suggested scheduling coefficients strategy proves to be practical and suitable for self-commissioning machine control systems.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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".