A Stochastic Game Approach for PEV Charging Station Operation in Smart Grid
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 the future, smart grid charging stations will be critical infrastructures for plug-in electric vehicle (PEV) to replenish their batteries in a convenient way. Due to the ever-increasing penetration rate of PEVs, how to efficiently manage the loads of PEV charging stations to ensure system efficiency and reliability is a major challenge faced by the distribution service providers (DSPs) in the smart grid. This challenge is further complicated by the highly dynamic PEV mobility, which results in random PEV arrivals, departures, and charging demands. In order to address this challenge, a stochastic game approach is proposed in this paper to characterize the interactions among DSP, charging stations, and PEV owners, where the randomness in charging decision making processes of PEV owners is modeled by a Markov decision process. Based on the Nash equilibrium solution of the stochastic game, a real time pricing scheme is proposed for the DSP to minimize power distribution losses while ensuring system reliability. The performance of the proposed approach is evaluated via extensive simulations based on the IEEE 123 bus test feeder with real vehicle mobility data from the 2009 National Household Travel Survey and the 2010 National Travel Survey.
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.001 |
| 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