Smart rate control and demand balancing for electric vehicle charging
Bibliographic record
Abstract
The anticipated high electric vehicle (EV) penetration motivates many research efforts to alleviate the potential associated grid impact. However, few works discuss the crucial issue: quality of service (QoS) degradation caused by competing for charging resources. This issue arises due to the limitation on power supply and charging space that charging stations can usually provide. Our work studies this issue and proposes an operational scheme that optimizes QoS for EV users while satisfying the stability of the power grid. The scheme consists of two levels. The lower level deals with charging rate control, for which we propose an efficient algorithm with provable QoS-optimal allocation of power supply to EVs. The upper level handles charging demand balancing, for which we design two approximation algorithms that schedule EVs to multiple charging stations. One algorithm is a 3-approximation with polynomial complexity; while the other is a (2 + e)-approximation using a fully polynomial time approximation scheme. Through extensive simulations based on realistic data traces and simulations tools, we demonstrate the efficiency and efficacy of our operational scheme and further provide interesting findings from in-depth analysis of the experimental results.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".