Adaptive Time Delay Strategy for Reliable Load Shedding in the Direct-Current Microgrid
Bibliographic record
Abstract
This paper proposes a practical and reliable decentralized load shedding strategy to protect the integrity of the direct-current (DC) microgrid. The proposed strategy utilizes time delays that automatically adapt to the DC microgrid operating conditions through continuous evaluation of the bus voltage variations, without depending on remote communication. It is evaluated in comparison with the conventional timer-based load shedding strategy. The studies are performed in the PSCAD software environment, on a detailed model of a DC microgrid that contains various types of loads and distributed energy resources. The results of the investigations show that the proposed adaptive time delay strategy (i) effectively restores the balance between the power demand and supply in the DC microgrid by quickly shedding the necessary amount of loads, (ii) is able to prioritize the non-critical loads by coordinating the load shedding steps based on a pre-determined order, (iii) prevents the steady-state values of the DC microgrid voltages from falling below a predetermined lower limit, (iv) significantly limits the voltage sags caused by power deficit in the microgrid, (v) is highly expandable and is able to coordinate a large number of load shedding steps, and (vi) improves the reliability of the electrical power provided to the DC microgrid loads, by avoiding inessential load shedding.
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.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".