Towards optimal energy store-carry-and-deliver for PHEVs via V2G system
Bibliographic record
Abstract
As an important component of smart grid, the vehicle-to-grid (V2G) system is recently introduced to enable bidirectional energy delivery between the power grid and plug-in electric vehicles. Communication technology is incorporated to facilitate the energy delivery by providing electricity pricing and energy demand information. However, different from the stationary energy storage systems, the energy store-carry-and-deliver mechanism for a V2G system poses new challenges for performance optimization, such as bi-directional energy flow and non-stationary energy demand. How to utilize the statistical information provided by the communication system to achieve efficient energy delivery is critical for a V2G system and is still an open issue. In this paper, we address a specific problem in this new research area, i.e., daily energy cost minimization of vehicle owners under time-of-use (TOU) electricity pricing. We investigate a plug-in hybrid electric vehicle (PHEV) with a realistic battery model, which is general for both battery electric cars and plug-in hybrids. A dynamic programming formulation is established by considering the bidirectional energy flow, non-stationary energy demand, battery characteristics, and TOU electricity price. We prove the optimality of a state-dependent double-threshold (or (S, S')) policy based on the stochastic inventory theory. A modified backward iteration algorithm is devised for practical applications, where an exponentially weighted moving average (EWMA) algorithm is used to estimate the statistics of PHEV mobility and energy demand. The performance of the proposed scheme is demonstrated by simulations based on survey and real data collected from Canadian households. Numerical results indicate that our proposed scheme performs closely to a scheme with a priori knowledge of the PHEV mobility and energy demand information. Compared with the existing approaches, the proposed scheme can achieve energy cost reduction, which increases with the battery capacity.
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.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 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".