Distributionally Robust Optimal Power Flow via Ellipsoidal Approximation
Bibliographic record
Abstract
This paper proposes a distributionally robust joint chance-constrained AC optimal power flow to manage the risk of operational limits violations which are caused by uncertain renewable generation. By determining the dispatch schedule, this approach can help to decrease the risk of renewable curtailment, load shedding, or emergency redispatch in real-time. To model the proposed approach, the renewable uncertainty is first modeled as a distributionally robust ellipsoidal bound based on the Wasserstein metric. This bound is built upon a limited historical renewable forecast errors dataset without any assumption on the probability distribution of uncertainty. Then, this uncertainty bound is adopted within a semidefinite relaxation of the optimal power flow. The system responses to the renewable generation forecast errors are modeled as linear sensitivities, where all conventional generators are responsible for compensating the impacts of renewable forecast errors. Numerical experiments on IEEE 14-bus and 118-bus systems show the validity and scalability of the proposed method. Furthermore, the effectiveness of the proposed approach in terms of meeting probabilistic guarantees, cost-effectiveness and computational time is also demonstrated in the experiments.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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".