Voltage Stability in Low-Voltage Distribution Grids Using Machine Learning Based Forecasting and MILP Based Optimization
Bibliographic record
Abstract
Voltage stability is a key factor in the reliable operation of distribution grid in the context of dynamic loads and changing power demand. Conventional voltage control methods depend on reactive power control and static adjustments, which make them ineffective in managing the rapid fluctuations caused by the unpredictable and variable nature of new load patterns such as electric vehicles and smart appliances. This paper focuses on a new approach to ensure voltage stability in low-voltage (LV) distribution grids using machine learning based forecasting and mixed integer linear programming (MILP) based optimization models for household load forecasting and optimization. The long short-term memory model is used on historical time series household load data, which accurately forecasts the day-ahead (short-term) household load. Then the MILP based optimization model for the home energy management system uses the forecasted load data to optimize load and ensure voltage stability in the LV distribution grid. In the base case, there are 238 instances out of 960, where voltage violations occur, but in the optimized case, the voltage violations were reduced to 36 instances in one day for 10 houses, leading to improved voltage stability in the LV distribution grid.
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.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 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.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".