Autonomous Demand Response Using Stochastic Differential Games
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
Demand response (DR) programs are implemented to encourage consumers to reduce their electricity demand when needed, e.g., at peak-load hours, by adjusting their controllable load. In this paper, our focus is on controllable load types that are associated with dynamic systems and can be modeled using differential equations. Examples of such load types include heating, ventilation, and air conditioning; water heating; and refrigeration. In this regard, we propose a new DR model based on a two-level differential game framework. At the beginning of each DR interval, the price is decided by the upper level (aggregator, utility, or market) given the total demand of users in the lower level. At the lower level, for each player (residential or commercial buildings that are equipped with automated load control systems and local renewable generators), given the price from the upper level, the electricity usage of air conditioning unit, and the battery storage charging/discharging schedules, are controlled in order to minimize the user's total electricity cost. The optimal user strategies are derived using the stochastic Hamilton-Jacobi-Bellman equations. We also show that the proposed game can converge to a feedback Nash equilibrium. Based on the effect of real-time pricing on users' daily demand profile, the simulation results demonstrate the properties of the proposed game and show how we can optimize consumers' electricity cost in the presence of time-varying prices.
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