Improved Differential Based Protection Scheme for Renewable Energy Based Microgrids With Low Communication Burden
Bibliographic record
Abstract
Due to prevalence of distributed energy resources, especially inverter interfaced ones, conventional protection systems meet substantial challenges for fault detection. Differential protection is the most reliable protection method for current networks; however, the conventional method leads to high communication burden. We propose a new differential protection based on disturbance detection and positive phase angle differences. The disturbance detection method is proposed based on Mathematical Morphology which has high speed and accuracy. Instead of transmitting the instantaneous values or the phasor of the currents which impose high communication burden on the network, the phase angle of the current is the only data which is transmitted when a sudden change is detected. The proposed method reduces the communication burden significantly and increases the resiliency of the protection scheme. The effectiveness of the proposed method is verified in modified IEEE 9 bus 3 machine network with three distributed energy resources. PSCAD is used to simulate the microgrid and the proposed method is implemented in MATLAB. It is proved that this method works properly in both islanded and grid connected modes and despite significant changes in the grid. The robustness of method in presence of noise and its high reliability and dependability is verified through various simulation case studies.
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.000 |
| 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.000 | 0.001 |
| 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".