Distributed Optimal Vehicle-To-Grid Approaches With Consideration of Battery Degradation Cost Under Real-Time Pricing
Bibliographic record
Abstract
Electric vehicles (EV) are becoming increasingly popular due to their efficiency and potentials to reduce greenhouse gas emission. However, penetration of a very large number of EVs can have negative impacts on power systems. This study proposes optimal vehicle-to-grid (V2G) models to incorporate the EV penetration by minimizing multiple objectives including the peak demand, the variance of load profile, the battery degradation cost and the EV charging/discharging cost based on real-time pricing (RTP). The proposed models incorporate EV driving patterns including driving distance, driving periods, and charging/discharging levels and locations. A nonlinear battery degradation cost function is linearized and incorporated into the optimal models. In addition, a distributed control algorithm is developed to implement the optimal models. One-day simulation results show that the proposed approach can reduce the peak demand and the variance of the load profile by 7.8% and 81.9%, which can significantly improve power system stability and energy efficiency. In addition, the sum of EV charging/discharging cost and battery degradation cost is decreased from $251 to -$153. In fact, 100 EVs earn $153 in the day from the V2G program. The approaches can be used by a load aggregator or a utility to effectively incorporate EV penetration to power systems to unlock V2G opportunities and mitigate negative impacts.
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.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".