Recurrent Neural Network (RNN) Based Algorithm in Multi‐Level Control of an Islanded DC Microgrid Connected to Variable Communication Networks
Bibliographic record
Abstract
ABSTRACT The utilization of microgrids (MGs) and energy communities has surged in recent years, enabling numerous stakeholders to participate in the power distribution system. Unfortunately, communication infrastructure failures in rural networks has increased the operational blind spots. In the event of a failure, information sharing may be delayed. To address this problem in a multi‐feeder MG, a resilient control approach utilizing RNN‐based control has been proposed to manage load sharing and voltage regulation during communication delays. A recurrent neural network (RNN) is utilized to optimize the control scheme for the operating direction for each distributed generating point. Traditional control may become unstable during information breaks, but the proposed RNN method improves connectivity during such occurrences. Through this analysis, the research showcased the efficacy of the proposed RNN technique in precisely distributing the load and regulating voltage, particularly during information breaks. The study also confirmed that the RNN strategy is more efficient than conventional control methods. The RNN approach creates a resilient and stable network to information failures, and the study's findings were derived from the detailed mathematical analysis of DC microgrid (DC MG) load conditions and radial networks' uncertain line characteristics.
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.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.001 | 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".