An Analytical Method to Obtain Maximum Allowable Grid Support by Using Grid-Connected Converters
Bibliographic record
Abstract
Recently, supporting the grid voltage and proper operation of the grid-connected converters (GCCs) under a wide range of grid voltage conditions have become major requirements. An analytical study is very useful for evaluating the supporting capability of the available control strategies in GCCs. This paper analytically studies, then modifies the supporting capability of three existing strategies. The contribution of this paper is two-fold: first, analytical expressions of instantaneous active/reactive powers oscillation and maximum phase currents are formulated and used to conduct several comparisons among different strategies. Second, based on the obtained formulas for the maximum phase currents, maximum allowable support (MAS) control schemes are proposed under unbalanced voltage conditions. The MAS control schemes have two important objectives: obtaining maximum active or reactive power delivery and simultaneously respecting the maximum phase currents under the unbalanced condition. The proposed equations can further estimate the maximum depth of the faulted voltage where each strategy is still able to satisfy the voltage support requirements imposed by the grid codes. The proposed expressions can also help all techniques to provide their maximum voltage or frequency support under the pre-set maximum phase current limitations. Different selected simulation and experimental tests are carried out for comparing the strategies, and validating the effectiveness of the proposed MAS equations.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".