MétaCan
Menu
Back to cohort
Record W2002033169 · doi:10.1109/tsg.2014.2311457

Real-Time PEV Charging/Discharging Coordination in Smart Distribution Systems

2014· article· en· W2002033169 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Smart Grid · 2014
Typearticle
Languageen
FieldEngineering
TopicElectric Vehicles and Infrastructure
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsPlug-inComputer scienceArchitecturePower (physics)Smart powerElectric power systemEngineeringAutomotive engineering

Abstract

fetched live from OpenAlex

This paper proposes a novel online coordination method for the charging of plug-in electric vehicles (PEVs) in smart distribution networks. The goal of the proposed method is to optimally charge the PEVs in order to maximize the PEV owners' satisfaction and to minimize system operating costs without violating power system constraints. Unlike the solutions reported in the literature, the proposed charging architecture guarantees the feasibility of the charging decisions by means of a novel prediction unit that can forecast future PEVs power demand and through an innovative two-stage optimization unit that ensures effective charging coordination. Coordinated PEV discharging also enables improved utilization of power system resources. Simulation results for a typical distribution network are provided as a demonstration of the effectiveness of the proposed architecture.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.550
Threshold uncertainty score0.927

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.005
GPT teacher head0.191
Teacher spread0.186 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it