Minimum Recovery Time Transients for Three-Phase Converters in the Synchronous Reference Frame
Bibliographic record
Abstract
Three-phase Pulse-Width-Modulated (PWM) converters require of closed-loop controllers to meet the performance requirements and to achieve reliable responses over the entire operating range. Conventionally, by using the synchronous reference frame (SRF) representation, different linear and nonlinear control strategies have been proposed to improve the converter's dynamic performance. However, the achieved improvements cannot be objectively assessed due to the absence of a performance limit standard reference of the converter's dynamics. In this work, the theoretical minimum time solutions for three-phase converters in the SRF are derived and analyzed, providing an objective reference point for the system's dynamic performance evaluation. The normalized dynamic model of the converter in the SRF is derived and combined with the Time Optimal Control Principle to find the theoretical minimum transient time solutions. The state-plane representation of these minimum time responses enables a straightforward and comprehensive interpretation of the converter's dynamic behavior and it simplifies the derivation of closed-form expressions that characterize the minimum time transient parameters. The introduced analysis, minimum time dynamic responses, derived transient's expressions, and dynamic performance evaluation are validated by simulation and experimental results.
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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".