Learning-Based Predictive Virtual Inertia Control for Frequency Regulation in Low Inertia Power Grids
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The increasing integration of renewable energy generators into the conventional power grid has lowered the overall power system inertia. Low inertia may adversely impact the grid’s stability and resilience, leading to unintended grid failure and total system collapse upon severe contingencies. Current methods of emulating power grid inertia to enhance stability under low inertia conditions have some drawbacks. For example, the proportional-integral (PI) control method suffers from high overshoot and settling time, while the performance of the conventional model predictive controller (MPC) is highly dependent on the accuracy of the system model. Consequently, a new learning-based predictive virtual inertia control (VIC) is proposed. This strategy incorporates a physics-informed neural network (PINN) predictive model with an optimization-based safety filter to mitigate the impact of increasing integration of renewable energy generators through a virtual inertia emulation strategy. Our proposed strategy leverages advances in deep learning by implementing a PINN-based model to predict the system’s future behavior. The proposed method is compared to the MPC and PI controller. The results demonstrate the superior dynamic performance of the proposed method. Our implemented technique achieved the least frequency deviations upon contingencies in the IEEE 34 bus and the IEEE 39 bus studied systems with integrated inverter-based 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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it