Service Restoration for a Renewable-Powered Microgrid in Unscheduled Island Mode
Bibliographic record
Abstract
This paper deals with the service restoration problem in renewable-powered microgrids that are driven islanded by an unscheduled breakdown from the main grid. The objective is to determine the maximum of the expected restorative loads by choosing the best arrangement of the power network configurations immediately from the beginning of the breakdown all the way to the end of the island mode. The intermittency nature of the renewable power, as well as the uncertainty of the duration of the breakdown pose new challenges to this classic optimization scheduling task. The proposed two scenario-splitting methods can be solved in a two-step solving procedure, in which a Lagrangian technique and dynamic programming are utilized to provide an analytical sub-optimal yet efficient solution to the original problem. Simulation results demonstrate that both methods can find solutions very close to optima effectively; the scheduling plan should be adjusted when the time evolves, especially when the renewable power generation takes a large portion in the power supply; and the energy storage system plays a significant role to reduce the risk of unreliability in the wind power forecasting, even with a small amount of capacity. Finally, the proposed approach can be applied to radially configured systems with other types of distributed generators.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| 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.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".