Application of energy storage systems for frequency regulation service
Bibliographic record
Abstract
Frequency control aims to maintain the nominal frequency of the power system through compensating the generation-load mismatch. In addition to fast response generators, energy storage systems can be exploited to provide frequency regulation service due to their fast ramping characteristic. In this paper, we propose a solution to leverage energy storage systems deployed in the distribution networks for secondary frequency regulation service by considering the uncertainty in system disturbances, the energy storage availability, and the AC power flow model. In particular, we tackle the uncertainty in the frequency deviations and alleviate the problem associated with the limited energy storage capacity by using a risk minimization technique. We formulate a linear program to determine the frequency regulation signals to schedule the energy storage systems by adopting the concept of conditional value-at-risk (CVaR). It enables us to minimize the risk of deviation from the nominal frequency after performing frequency regulation, while satisfying the operation constraints of the distribution network. Simulations are performed on an IEEE 37-bus test feeder with three energy storage systems that participate in the frequency regulation service. Results show that by using the proposed approach, the charging/discharging of the energy storage systems can be scheduled to regulate the frequency, and the risk of energy storage systems not being able to contribute to future regulation service can be reduced.
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.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.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 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".