Centralized and Distributed Optimization for Vehicle-to-Grid Applications in Frequency Regulation
Bibliographic record
Abstract
This paper proposes centralized and distributed optimization models for V2G applications to provide frequency regulation in power systems and the electricity market. Battery degradation and dynamic EV usages such as EV driving period, driving distance, and multiple charging/discharging locations are modeled. The centralized V2G problem is formulated into the linear programming (LP) model by introducing two sets of slack variables. However, the centralized model encounters limitations such as privacy concerns, high complexity, and central failure issues. To overcome these limitations, the distributed optimal V2G model is developed by decomposing the centralized model into subproblems using the augmented Lagrangian relaxation (ALR) method. The alternating direction method of multipliers (ADMM) is used to solve the distributed V2G model iteratively. The proposed models are evaluated using real data from the Independent Electricity System Operator (IESO) Ontario, Canada. Simulation results show that the proposed models can aggregate EVs for frequency regulation; meanwhile, the EV owners can obtain monetary rewards. The simulation also shows that including battery degradation and dynamic EV usage increases the model accuracy. By using the proposed approaches, the high cost and the low efficiency power generation units for frequency regulation can be compensated or partially replaced by EVs, which will reduce the generation cost and greenhouse gas emissions.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 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.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".