PMSM Drive System Efficiency Optimization Using a Modified Gradient Descent Algorithm With Discretized Search Space
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This article investigates efficiency optimization in a permanent magnet synchronous machine (PMSM) drive system, including the motor and the power converter. At first, the motor drive efficiency model based on the input and output power is proposed. In this model, the input power is calculated from the dc-link voltage and current measurements, and the output power is modeled and computed from the dq-axis voltages and currents considering temperature rise, magnetic saturation, cross-coupling effect, and inverter nonlinearity. The proposed efficiency model includes both the inverter and motor losses without the need of loss models, so it simplifies the efficiency calculation significantly. Based on this efficiency model, a novel gradient descent algorithm-based approach with a discrete search space and proper constraints is proposed to optimize the PMSM drive system efficiency, ensure a fast searching speed, and reduce the influence from measurement uncertainties. Compared with the existing approaches, the proposed approach is computationally efficient, does not require loss models, and is noninvasive as no signal injection is involved. The proposed approach is evaluated on a laboratory PMSM drive system with extensive experimental tests.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it