Joint Arbitrage and Operating Reserve Scheduling of Energy Storage Through Optimal Adaptive Allocation of the State of Charge
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
Energy storage can become one of the portfolio solutions in modern power systems by increasing the grid's resilience. The intensive capital cost of storage, however, is one of the most important barriers to its proliferation. To alleviate the impact of its sizable capital expenditure, exploiting the full benefit of storage should be targeted through joint applications. The economic efficiency of jointly scheduled storage, however, is seriously undermined if its capacity is not optimally allocated for each application. This paper unveils a new storage scheduling algorithm for the joint arbitrage and operating reserve (OPR) as merchant functions. The optimization slack variables are employed as fictitious capacities to adapt the upper and lower bounds of the state of charge (SOC). The storage SOC is, then, optimally allocated for the arbitrage and OPR. Via an adaptive penalizing mechanism and soft constraints, OPR signals are incorporated into the optimization process. Anew index is formulated to quantify the storage participation toward OPR. Market price modulation factors are presented for financial analysis of the storage contribution to the OPR market. Numerical studies are conducted over the storage operation using historical market data to validate the efficacy of the proposed model.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 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.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