Maximum Torque Per Ampere Angle Detection for Interior Permanent Magnet Synchronous Machines based on Signal Injection
Bibliographic record
Abstract
Maximum torque per ampere (MTPA) control is designed to identify the ideal current angle for interior permanent magnet synchronous machines (IPMSMs), aiming to minimize current consumption while achieving the required torque. This paper introduces an innovative MTPA control strategy for IPMSM utilizing gradient descent algorithm and signal injection. The approach involves injecting small current harmonics into the machine to search for the MTPA angle. Derived from the torque equation specific to the IPMSM, a fundamental relationship is established between the induced current harmonic and the speed harmonic of the machine. This relationship reveals that the first-order induced speed harmonic emerges solely when a disparity arises between the machine parameters employed in MTPA control and the real machine parameters. Consequently, the investigation of speed harmonics is employed to identify and adjust the MTPA angle by minimizing the magnitude of the speed harmonic through the application of the gradient descent algorithm. The proposed approach doesn't necessitate knowledge of machine parameters for MTPA angle calculation, ensuring a robust MTPA control across varying loading and speed conditions. To validate its efficacy, extensive simulations were conducted employing a nonlinear PMSM model derived from finite element analysis (FEA).
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.001 | 0.000 |
| 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".