Model Predictive Control for Smart Grids with Multiple Electric-Vehicle Charging Stations
Bibliographic record
Abstract
Next-generation power grids will likely enable concurrent service for residences and plug-in electric vehicles (PEVs). While the residence power demand profile is known and thus can be considered inelastic, the PEVs' power demand is only known after random PEVs' arrivals. PEV charging scheduling aims at minimizing the potential impact of the massive integration of PEVs into power grids to save service costs to customers while power control aims at minimizing the cost of power generation subject to operating constraints and meeting demand. The present paper develops a model predictive control (MPC)- based approach to address the joint PEV charging scheduling and power control to minimize both PEV charging cost and energy generation cost in meeting both residence and PEV power demands. Unlike in related works, no assumptions are made about the probability distribution of PEVs' arrivals, the known PEVs' future demand, or the unlimited charging capacity of PEVs. The proposed approach is shown to achieve a globally optimal solution. Numerical results for IEEE benchmark power grids serving Tesla Model S PEVs show the merit of this approach.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".