MétaCan
Menu
Back to cohort

Modified and Augmented Nodal Analysis-based Optimal Power Flow

2025· article· W4415968464 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

Venuenot available
Typearticle
Language
FieldEngineering
TopicOptimal Power Flow Distribution
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsNodal analysisPower flowPower (physics)Nonlinear systemFlow (mathematics)Variety (cybernetics)Electric power systemMatrix (chemical analysis)Modified nodal analysis

Abstract

fetched live from OpenAlex

The optimal power flow (OPF) problem focuses on the operational efficiency of electric power systems. Modern grids include a variety of devices that are often omitted in traditional OPF formulations, namely, different types of generators, transformers, or power electronics-based devices. The modified and augmented nodal analysis (MANA) extends the traditional nodal analysis by expressing circuit equations in a generic sparse matrix representation. The MANA approach can seamlessly accommodate constraints from various types of devices commonly encountered in modern networks. This, in turn, allows their straightforward inclusion as constraints in OPF by modelling them through MANA using their current and voltage equations. This work proposes a new OPF formulation based on MANA and the corresponding power flow constraints, which we refer to as MANA-OPF. The non-convex MANA-OPF is solved using a nonlinear solver, namely, IPOPT in Julia. The formulation is tested on several test cases. The results are compared to a standard approach used by PowerModels.

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 categoriesMeta-epidemiology (narrow), Insufficient payload (model declined to judge)
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.750
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.002
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.0020.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.228
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

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicOptimal Power Flow DistributionFrench-language works237,207