MétaCan
Menu
Back to cohort
Record W2924995203 · doi:10.22215/etd/2015-10629

Fluid Approximation of Smart Grid Systems: Optimal Control of Energy Storage Unit

2015· dissertation· en· W2924995203 on OpenAlexaff
Rasha H. Sakr

Bibliographic record

Venuenot available
Typedissertation
Languageen
FieldBusiness, Management and Accounting
TopicAdvanced Queuing Theory Analysis
Canadian institutionsCarleton University
Fundersnot available
KeywordsMathematical optimizationEnergy storageSmart gridGridLimit (mathematics)Optimal controlOptimization problemComputer scienceEnergy (signal processing)Work (physics)Markov decision processMarkov processPower (physics)EngineeringMathematicsElectrical engineering

Abstract

fetched live from OpenAlex

A model of the smart grid system with two different energy sources -the main grid and the energy storage units -is considered.The arriving power demands can be activated by either type of energy sources, with differing rates and costs.Finding an optimal policy that minimizes the expected long-run operational cost of the system is the main interest of this work.The problem is considered in a so called heavy traffic regime, and is solved using fluid approximation techniques.The formal scaling limit of the problem leads to a simple deterministic optimization problem, whose solution is shown to be an achievable lower bound on the limiting cost of the stochastic problem.Three different scenarios are considered according to whether the batteries are disposable or rechargeable and whether the arrival rates are homogeneous or nonhomogeneous.The solution method provides a good alternative to numerical methods such as Markov Decision Processes. RES modelThe smart grid system in which rechargeable energy storage units (batteries) are used.x

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.003
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: Empirical · Consensus signal: none
Teacher disagreement score0.021
Threshold uncertainty score0.042

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0020.001
Open science0.0010.001
Research integrity0.0010.002
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.012
GPT teacher head0.235
Teacher spread0.223 · 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
GenreEmpirical

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

Citations1
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Queuing Theory AnalysisFrench-language works237,207