Predictive Control of Flexible Resources for Demand Response in Active Distribution Networks
Bibliographic record
Abstract
In this paper, a model-based predictive control method is proposed for utilization of flexible resources such as battery energy storage systems and heating systems effectively to provide demand response in low-voltage distribution networks with solar photovoltaic. The contributions of this paper are twofold. First, a linear power flow method based on relaxation of branch power losses applicable to radial distribution networks is proposed and formulated. Second, a flexible resources controller that solves a multi-objective linear optimization problem in receding-horizon fashion is formulated taking into account system states, forecasts of generation, and loads. Using the proposed control algorithm, flexibility from network resources can be utilized for low-voltage network management with assurance of quality of service to the customers. Simulations are conducted for summer and winter cases on a simplified Danish low-voltage network using Matlab/Simulink to study the performance of the proposed control method. Compared to the methods in state of the art, the proposed linear power flow method is proven to be accurate for the calculation of network power flows. Simulation results also show that proposed flexible resources controller can meet the network control objectives while satisfying the network constraints and operation limits of the flexible resources.
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.000 | 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.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".