An Extended State Space Model for Aggregation of Large-Scale EVs Considering Fast Charging
Bibliographic record
Abstract
This article presents an extended state space model for aggregation of large-scale electric vehicles (EVs) for frequency regulation and peak load shaving in power systems. The proposed model systematically deals with the fast charging of EVs as an effective solution for immediate charging requirements. Furthermore, the proposed extended state space model increases the flexibility of the EV aggregator (EVA) by enabling the EVs to participate in ancillary services with both regular and fast charging/discharging rates. This will help the EVA to provide a prompt and efficient response to severe generation-consumption imbalances. A probabilistic control approach is developed which reduces the communication burden of the EVA. Furthermore, the uncertainties related to EV users' behavior are modeled in real-time. The simulations are conducted for a typical power system including a large population of EVs, a conventional generator (CG), and a wind generation system. It is shown that the proposed aggregation model can accurately describe the aggregated behavior of a large population of EVs enabling them to efficiently participate in frequency regulation and peak load shaving services. Finally, the performance of EVA is evaluated for different driving behaviors and state of charge (SOC) levels of the EV population.
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.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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".