Load Scheduling and Power Trading in Systems With High Penetration of Renewable Energy Resources
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
In this paper, we focus on the problems of load scheduling and power trading in systems with high penetration of renewable energy resources (RERs). We adopt approximate dynamic programming to schedule the operation of different types of appliances including must-run and controllable appliances. We assume that users can sell their excess power generation to other users or to the utility company. Since it is more profitable for users to trade energy with other users locally, users with excess generation compete with each other to sell their respective extra power to their neighbors. A game theoretic approach is adopted to model the interaction between users with excess generation. In our system model, each user aims to obtain a larger share of the market and to maximize its revenue by appropriately selecting its offered price and generation. In addition to yielding a higher revenue, consuming the excess generation locally reduces the reverse power flow, which impacts the stability of the system. Simulation results show that our proposed algorithm reduces the energy expenses of the users. The proposed algorithm also facilitates the utilization of RERs by encouraging users to consume excess generation locally rather than injecting it back into the power grid.
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