A cumulative sum-based protection method for inverter-interfaced microgrids
Bibliographic record
Abstract
• Proposing a Fast, Accurate, and simple algorithm for fault detection in inverter based microgrid. • Detailed modeling of inverter-based resources. • Performance evaluation across different conditions. • Comprehensive real-time testing. This paper presents a MCUSUM-based protection scheme for enhancing fault detection in high-IBR microgrids, specifically considering both grid-following and grid-forming inverters in the modeling, analysis, and testing phases. While previous works have focused on overcurrent, impedance-based and differential protection schemes, they often struggle with low short-circuit currents and variable power factors during faults, limiting their effectiveness in high-IBR environments. The proposed approach enables rapid direction change detection and coordinated relay operation through control flag exchanges. Real-time experiments using the Typhoon platform validate the method's effectiveness across low voltage ride-through (LVRT) grid codes from different countries. Results demonstrate reliable fault detection in both grid-connected and islanded modes, effectively managing various fault types and resistance levels under acceptable noise levels. The proposed method not only addresses the limitations of existing protection strategies but also showcases adaptability in diverse operational scenarios, making it a practical solution for enhancing the reliability of microgrid systems with high IBR penetration.
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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".