Mean Field Game-Based Algorithms for Charging in Solar-Powered Parking Lots and Discharging into Homes a Large Population of Heterogeneous Electric Vehicles
Bibliographic record
Abstract
An optimal daily scheme is presented to coordinate a large population of heterogeneous battery electric vehicles when charging in daytime work solar-powered parking lots and discharging into homes during evening peak-demand hours. First, we develop a grid-to-vehicle strategy to share the solar energy available in a parking lot between vehicles where the statistics of their arrival states of charge are dictated by an aggregator. Then, we develop a vehicle-to-grid strategy so that vehicle owners with a satisfactory level of energy in their batteries could help to decongest the grid when they return by providing backup power to their homes at an aggregate level per vehicle based on a duration proposed by an aggregator. Both strategies, with concepts from Mean Field Games, would be implemented to reduce the standard deviation in the states of charge of batteries at the end of charging/discharging vehicles while maintaining some fairness and decentralization criteria. Realistic numerical results, based on deterministic data while considering the physical constraints of vehicle batteries, show, first, in the case of charging in a parking lot, a strong to slight decrease in the standard deviation in the states of charge at the end, respectively, for the sunniest day, an average day, and the cloudiest day; then, in the case of discharging into the grid, over three days, we observe at the end the same strong decrease in the standard deviation in the states of charge.
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 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".