Grid Dispatch v1: 500 hard tasks (453 train / 47 test, split by day)
Browse files- README.md +113 -0
- data/test.jsonl +0 -0
- data/train.jsonl +0 -0
README.md
ADDED
|
@@ -0,0 +1,113 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: cc-by-4.0
|
| 3 |
+
pretty_name: Grid Dispatch tasks
|
| 4 |
+
tags:
|
| 5 |
+
- reinforcement-learning
|
| 6 |
+
- rl-environment
|
| 7 |
+
- agents
|
| 8 |
+
- tool-use
|
| 9 |
+
- operations-research
|
| 10 |
+
- power-systems
|
| 11 |
+
- unit-commitment
|
| 12 |
+
size_categories:
|
| 13 |
+
- n<1K
|
| 14 |
+
configs:
|
| 15 |
+
- config_name: default
|
| 16 |
+
data_files:
|
| 17 |
+
- split: train
|
| 18 |
+
path: data/train.jsonl
|
| 19 |
+
- split: test
|
| 20 |
+
path: data/test.jsonl
|
| 21 |
+
---
|
| 22 |
+
|
| 23 |
+
# Grid Dispatch tasks
|
| 24 |
+
|
| 25 |
+
500 tasks for the [Grid Dispatch](https://github.com/savarbhasin/grid-dispatch) RL environment (Verifiers v1). **An AI
|
| 26 |
+
runs a power grid for one real day:** it decides which of 17 power plants are on each hour, and when to use a battery,
|
| 27 |
+
to keep the lights on at the lowest cost.
|
| 28 |
+
|
| 29 |
+
The day plays out in 4-hour steps. At each step the AI looks, tests ideas with `simulate`, gives orders, then advances
|
| 30 |
+
the clock. The **real** day happens as it goes: demand differs from the forecast, wind falls short, and plants break
|
| 31 |
+
down. Decisions can't be undone, and big plants need hours of notice, so a good dispatcher has to act before the problem
|
| 32 |
+
arrives.
|
| 33 |
+
|
| 34 |
+
| Split | Tasks | Real days |
|
| 35 |
+
| --- | --- | --- |
|
| 36 |
+
| `train` | 453 | 252 |
|
| 37 |
+
| `test` | 47 | 28 |
|
| 38 |
+
|
| 39 |
+
The split is **by real day**: one day can appear several times with a different fleet and breakdowns, and no day is in
|
| 40 |
+
both splits. Test rows don't include the solver's moves.
|
| 41 |
+
|
| 42 |
+
```python
|
| 43 |
+
from datasets import load_dataset
|
| 44 |
+
test = load_dataset("dev-front/grid-dispatch-tasks", split="test")
|
| 45 |
+
```
|
| 46 |
+
|
| 47 |
+
## How a task is made
|
| 48 |
+
|
| 49 |
+
1. **A real day:** one 2024 day for a US grid area (SPP, ERCOT, MISO, PJM or ISNE) from EIA-930, giving hourly demand,
|
| 50 |
+
its real day-ahead forecast, and wind and solar output. Days where actual net load beat the forecast most are
|
| 51 |
+
preferred.
|
| 52 |
+
2. **A fleet:** 17 plants sampled from the RTS-GMLC test system in PGLib-UC (nuclear, coal, combined cycle, steam,
|
| 53 |
+
peakers), plus a battery. The day is scaled so its peak fills 85% of the fleet.
|
| 54 |
+
3. **Breakdowns:** 0–2 big plants trip during the day, mostly in the hours before the evening peak.
|
| 55 |
+
4. **A reference dispatcher:** a solver (HiGHS) that re-plans every 4 hours with exactly the information the AI has,
|
| 56 |
+
keeping spare power for one breakdown or any two. Each day uses whichever version did better.
|
| 57 |
+
5. **Keep only hard days:** following the midnight plan, and doing nothing, must both score ≤ 0.6 (on average they
|
| 58 |
+
score 0.10 and 0.15), and the reference must lose at most 1% of the day's power (it loses none on 333 of 500).
|
| 59 |
+
|
| 60 |
+
Replaying the reference's moves reproduces its exact cost on every task.
|
| 61 |
+
|
| 62 |
+
## Fields
|
| 63 |
+
|
| 64 |
+
| Field | Meaning |
|
| 65 |
+
| --- | --- |
|
| 66 |
+
| `id` | `<area>-<date>-c<candidate>` |
|
| 67 |
+
| `world.units` | The 17 plants: `pmin`, `pmax` (MW), `ramp`, `min_up` / `min_down` (hours), `lead` (hours of notice to start), `startup_cost`, `curve` (MW, $/h) |
|
| 68 |
+
| `world.battery` | `power` (MW), `energy` (MWh), `eff` (one-way efficiency), `soc0` (starting charge share) |
|
| 69 |
+
| `world.demand`, `world.demand_da` | Actual and day-ahead forecast demand per hour (MW, scaled) |
|
| 70 |
+
| `world.renew`, `world.renew_da` | Actual wind+solar, and its forecast, per hour (MW, scaled) |
|
| 71 |
+
| `world.trips` | Plant → hour it breaks. **Hidden from the AI** until it happens |
|
| 72 |
+
| `world.init_on`, `world.init_p` | Which plants are on at midnight, and their output |
|
| 73 |
+
| `reference.policy` | `rolling` (spare power for one breakdown) or `rolling2` (for any two) |
|
| 74 |
+
| `reference.cost`, `reference.shed_mwh`, `reference.demand_mwh` | The reference's total cost, unserved energy, and the day's demand: what the score is measured against |
|
| 75 |
+
| `reference.baselines` | Every policy played on this day (`rolling`, `rolling2`, `hindsight`, `static`, `myopic`, `nothing`) with its cost, unserved MWh, start-ups and score |
|
| 76 |
+
| `reference.actions` | The reference's moves step by step (train only) |
|
| 77 |
+
|
| 78 |
+
**`world` holds the hidden truth** (the actual demand, wind and trips). The environment only reveals it as the clock
|
| 79 |
+
passes. Keep it out of prompts.
|
| 80 |
+
|
| 81 |
+
## Score
|
| 82 |
+
|
| 83 |
+
**Score = reliability × economy**, each against the reference:
|
| 84 |
+
|
| 85 |
+
- **reliability** = `e^(−excess unserved MWh / (0.5% of the day's demand))`;
|
| 86 |
+
- **economy** = `0.2 + 0.8·e^(−overspend / 10%)`, where overspend is fuel, no-load and start-up cost above the
|
| 87 |
+
reference's.
|
| 88 |
+
|
| 89 |
+
Blackouts can't be bought off with fuel savings, and matching or beating the reference scores 1.0.
|
| 90 |
+
|
| 91 |
+
## Baselines (the 5 hardest days, all from `train`; one attempt, no thinking cap)
|
| 92 |
+
|
| 93 |
+
| Model | Average score |
|
| 94 |
+
| --- | --- |
|
| 95 |
+
| DeepSeek V4.1 Flash | 0.39 (one day 1.00, one 0.64, three ≤ 0.15) |
|
| 96 |
+
| Nemotron Lightning 3.5 30B-A3B | 0.12 |
|
| 97 |
+
|
| 98 |
+
DeepSeek never overspends, but on hard days it keeps too little spare power and is caught by the second breakdown.
|
| 99 |
+
|
| 100 |
+
## Licence and attribution
|
| 101 |
+
|
| 102 |
+
Released under **CC BY 4.0**. Built from:
|
| 103 |
+
- **EIA-930** Hourly Electric Grid Monitor (US Energy Information Administration; US government data). In the 2024
|
| 104 |
+
files, PJM's forecast was shifted back one hour.
|
| 105 |
+
- **[PGLib-UC](https://github.com/power-grid-lib/pglib-uc)** (CC BY 4.0), RTS-GMLC test system
|
| 106 |
+
([GridMod/RTS-GMLC](https://github.com/GridMod/RTS-GMLC)). Changes: units sampled, renamed and rounded, and given
|
| 107 |
+
synthetic start-up notice times.
|
| 108 |
+
|
| 109 |
+
**Synthetic parts:** start-up notice times, the wind/solar forecast (actual plus half of yesterday's error), the trips,
|
| 110 |
+
the battery, and the scaling.
|
| 111 |
+
|
| 112 |
+
The reward pattern (real records plus a solver reference) is inspired by
|
| 113 |
+
[PortSimEnv](https://github.com/adithya-s-k/FineEnvs/tree/main/07-simulation-environments).
|
data/test.jsonl
ADDED
|
The diff for this file is too large to render.
See raw diff
|
|
|
data/train.jsonl
ADDED
|
The diff for this file is too large to render.
See raw diff
|
|
|