MétaCan
Menu
Back to cohort
Record W2113060087 · doi:10.1109/pscc.2014.7038382

An affine arithmetic approach for microgrid dispatch with variable generation and load

2014· article· en· W2113060087 on OpenAlexaff
Mehrdad Pirnia, Claudio A. Cañizares, Kankar Bhattacharya, Alfredo Vaccaro

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicMicrogrid Control and Optimization
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsDispatchable generationAffine arithmeticMicrogridAffine transformationVariable (mathematics)Mathematical optimizationRenewable energyComputer scienceMonte Carlo methodState variableControl theory (sociology)Wind powerInterval (graph theory)Interval arithmeticElectric power systemPower (physics)Distributed generationMathematicsControl (management)EngineeringStatisticsElectrical engineering

Abstract

fetched live from OpenAlex

A self-validated computing (SVC) method, based on affine arithmetic (AA) is proposed in this paper to solve the optimal power flow (OPF) problem for microgrids with renewable sources of variable generation. In the AA-based OPF formulation, all the state and control variables are presented in affine form, to represent the variable load, and wind and solar generation. Hence, the OPF model becomes an interval-based model with upper and lower bounds to represent the uncertain variables. To check the accuracy of the AA-based method, the resulted intervals are compared against those obtained from Monte-Carlo Simulation (MCS), in a 13-bus microgrid test system. The obtained real power generation intervals for thermal generators are used to determine the reserves required in dispatchable generators in the short-term to properly supply for the variability of load and intermittent renewable generation sources.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0030.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.004
GPT teacher head0.164
Teacher spread0.160 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations7
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicMicrogrid Control and OptimizationFrench-language works237,207