An adaptive virtual impedance fault current limiter for optimal protection coordination of islanded microgrids
Bibliographic record
Abstract
Abstract Fault currents of inverter‐interfaced distributed generators (IIDGs) depend on inverter controllers. Thus, IIDGs fault currents are different than those of synchronous‐based DGs, both from the magnitude and waveshape perspectives. In the event of short‐circuit faults, droop‐based IIDGs switch between a voltage source and a current source, which increases the complexity and non‐linearity of short‐circuit current calculation (SCC). This paper proposes a new SCC algorithm that incorporates virtual impedance‐fault current limiters (VI‐FCLs) to enable modelling droop‐based IIDGs as a voltage source behind an impedance. The VI‐FCL was implemented as an additional control loop in the inverter control scheme to limit IIDG fault currents and achieve optimal protection coordination (OPC). Further, the VI‐FCL is adaptively adjusted to enhance overcurrent protection sensitivity. A two‐stage OPC algorithm for directional overcurrent relays (DOCRs) is developed. In Stage I, an optimal value for the adaptive VI‐FCLs and relay currents are calculated. Stage II aims at obtaining optimal DOCRs settings. Time‐domain simulations are used to demonstrate the effectiveness of the proposed adaptive VI‐FCL and the accuracy of the proposed SCC algorithm. The proposed SCC algorithm and the OPC program are successfully validated using an islanded microgrid that is part of a Canadian distribution system.
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.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".