Measurement-Based Optimal DER Dispatch With a Recursively Estimated Sensitivity Model
Bibliographic record
Abstract
This paper presents a measurement-based method to determine distributed energy resource (DER) active- and reactive-power setpoints that minimize bus voltage deviations from prescribed reference values, bus active- and reactive-power deviations from desired setpoints, as well as cost of DER outputs. Central to the proposed method is the estimation of a linear sensitivity model from synchronized voltage and power-injection data collected from distribution-level phasor measurement units installed at only a subset of buses in the distribution system. As new measurements become available, the linear sensitivity model is updated via the recursive weighted partial least-squares estimation method. The estimated sensitivity model is then embedded as an equality constraint in a convex quadratic optimization problem, which can be solved via, e.g., the alternating direction method of multipliers. Numerical simulations involving the IEEE 33-bus distribution test system illustrate key benefits of the proposed method, including (i) eliminating the need for an accurate offline system model, (ii) adapting to online network-topology and operating-point changes, and (iii) being robust against delays potentially attributed to communication, computation, and actuation. Additional numerical simulations involving larger test systems demonstrate computational scalability.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| 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.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".