Mobility-Aware Vehicle-to-Grid Control Algorithm in Microgrids
Bibliographic record
Abstract
In a vehicle-to-grid (V2G) system, electric vehicles (EVs) can be efficiently used as power consumers and suppliers to achieve microgrid (MG) autonomy. Since EVs can act as energy transporters among different regions (i.e., MGs), it is an important issue to decide where and when EVs are charged or discharged to achieve the optimal performance in a V2G system. In this paper, we propose a mobility-aware V2G control algorithm (MACA) that considers the mobility of EVs, states of charge of EVs, and the estimated/actual demands of MGs and then determines charging and discharging schedules for EVs. To optimize the performance of MACA, the Markov decision process problem is formulated and the optimal policy on charging and discharging is obtained by a value iteration algorithm. Since the mobility of EVs and the estimated/actual demand profiles of MGs may not be easily obtained, a reinforcement learning approach is also introduced. Evaluation results demonstrate that MACA with the optimal and learning-based policies can effectively achieve MG autonomy and provide higher satisfaction on the charging.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".