Decentralized Data-driven Optimal Control for the Microgrid
Bibliographic record
Abstract
Recent advances in climate change policies and sustainable energy systems are spurring the widespread deployment of microgrids. The main operational challenge of these systems is the lack of inertia (in islanded mode) that is typically present in the main grid. To preserve the stable operation of the system, efficient control algorithms are necessary. In this paper, we present a novel optimal control algorithm that leverages constructs from machine learning to decouple interactions between various actuating power components in the microgrid. This allows every actuating entity to make control decisions based only on local measurements. As no communication is necessary with our proposed control algorithm, vulnerabilities and delays that are typically associated with communication-based control algorithms are eliminated. Also, in contrast to traditional decentralized techniques (e.g. droop-based) that are myopic in nature, our algorithm allows for the tracking of the original setpoint without any offsets as the global interactions are accounted for by the machine learning component of the proposed algorithm. We demonstrate the performance, stability and scalability of our proposal via practical simulations conducted on a 15-bus microgrid system.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| 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".