Backend
State-of-Charge Targets for Storage Participation in Two-Settlement Markets: Reliability, Price, and Compensation Impacts
arXiv cs.SY0 views
arXiv:2611.17739v1 Announce Type: new Abstract: As energy storage assumes a larger role in electricity systems, market operation must coordinate its use across time to support reliability during periods of system stress. Minimum state-of-charge (SOC) targets provide a means of preserving energy for these periods, but their design shapes reliability, operating efficiency, and storage compensation. This paper evaluates alternative SOC target designs in a California-based day-ahead and real-time electricity market model. The comparison examines targets based on day-ahead schedules or rolling centralized dispatch, enforced at the individual-resource or system level, across seasons, stress conditions, and participant information settings. The results show that retaining more energy does not necessarily reduce load shedding: targets that restrict discharge can limit storage support during shortages. Under critical summer conditions, individual targets derived from rolling centralized dispatch reduce weekly load shedding by approximately 83--84\% relative to operation without targets. Lower RT clearing costs and average prices can coexist with higher storage compensation, reflecting the role of day-ahead positions and real-time deviations in determining settlement outcomes. These findings highlight the importance of coordinating energy retention with timely discharge and network deliverability when designing SOC requirements for storage participation in electricity markets.
Source:https://arxiv.org/abs/2611.17739PreviousFrequency-Security-Aware Real-Time Economic Dispatch with Data Center UPS Flexibility for Inertia and Primary Frequency Response ServicesNextGraph Neural Network Prediction of Frequency Nadir and RoCoF Under Topology Variations
Related posts

Dreame X50 Ultra: designing a Shopify buying journey around fit, bundles and payment conditions
0dev.to JavaScript
Connect Four in 86 lines: how I coded the rules for a multiplayer browser game
0dev.to JavaScript
From Prompt to Production: Architectural Deep‑Dive into MIT’s “How to Make Almost Anything” Framework
0dev.to Rust
PRISM: Preference-based Reward and Uncertainty-Integrated Synthesis Minimization for RTL PPA Optimization
0arXiv cs.SE
The $\alpha$-Limit Problem: Convergence of a Linear Degenerate Interface Transmission Problem
0arXiv cs.NA
A Spectral Proximal DC Algorithm with Nonmonotone Line Search and Extrapolation
0arXiv cs.NA