A Blind Spot in the LVRT Current Requirements of Modern Grid Codes for Inverter-Based Resources
Bibliographic record
Abstract
Modern grid codes (GCs) require that inverter-based resources (IBRs) inject both positive- and negative-sequence currents during asymmetrical low-voltage ride through (LVRT) conditions. This GC provision prioritizes the reactive currents and also demands maximizing the active positive-sequence current if the IBR has unused current generation capacity when the required reactive current is generated. A variety of inverter control schemes are available to generate positive- and negative-sequence active/reactive currents, and satisfying these GCs seems to be straightforward. However, this paper reveals that the reference current generation methods of existing inverter control schemes fail to fulfil some important requirements of recent GCs. For example, they do not fully utilize the inverter capacity to generate the maximum active and/or reactive current. It is shown that these so-far hidden GC violations can result in a large untapped generation capacity during asymmetrical faults. This paper also develops an algorithm that satisfies recent GCs by deriving the positive- and negative-sequence currents that maximize the IBR’s reactive and active currents while the reactive current is prioritized. The simulation of a grid with high IBR penetration verifies that this new algorithm can unlock the full potential of recent GCs by significantly increasing the power generated during LVRT.
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.001 | 0.003 |
| 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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".