Daily electric vehicle charging dataset for training reinforcement learning algorithms
Bibliographic record
Abstract
Reinforcement learning algorithms are increasingly utilized across diverse domains within power systems. One notable challenge in training and deploying these algorithms is the acquisition of large, realistic datasets. It is imperative that these algorithms are trained on extensive, realistic datasets over numerous iterations to ensure optimal performance in real-world scenarios. In pursuit of this goal, we curated a comprehensive dataset capturing electric vehicle (EV) charging details over a span of 29,600 days within a designated parking facility. This dataset encompasses necessary information such as connection times, charging durations, and energy consumption of individual EVs. The methodology involved employing conditional tabular generative adversarial networks (CTGAN) to craft a pool of synthetic dataset from a smaller initial dataset collected from an EV charging facility located on the Caltech campus. Subsequently, multiple post-processing techniques were implemented to extract data from this pool, ensuring compliance with the charging station's capacity constraint while maintaining a realistic daily EV demand profile derived from historical data. Using kernel density estimation (KDE), the distributional characteristics of the historical data, especially concerning the timing of EV connections, were faithfully replicated. The developed dataset is specifically useful in training offline reinforcement learning algorithms.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.006 | 0.004 |
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".