Two-stage cooperative modular-based approach for solving online optimal power flow problems
Bibliographic record
Abstract
Various optimal power flow (OPF) algorithms have been utilized in power networks primarily for cost reduction, profit optimization and/or system loss minimization. However, these optimization solvers are either computationally demanding or sensitive to initialization settings and do not guarantee a global optimal. In order to overcome these challenges, this paper proposes an artificial intelligent based optimal power flow (AI-OPF) solver that makes use of a learning architecture of specialized cooperative neural networks (NNs) modules to reproduce a relationship between input and output variables for different loading/generation conditions without using OPF. The proposed algorithm takes advantage of the high computational speed of NN and employs semidefinite programming for the training stage, in order to capture the global optimality property of the technique. The algorithm consists of two stages: the first stage is a classification process which analyzes the loading conditions on the network and assigns it to a pre-identified class; and the second stage performs a class-specific optimal power flow. The proposed optimization approach is suitable for microgrid real-time applications, wherein the operation setup (bus voltages, line flows, etc.) changes rapidly. Numerical tests on a 30-bus system demonstrate the ability of the proposed algorithm to outperform the well-known OPF-based algorithms of MatPower package in terms of computational time and accuracy to attain near-global optimal solutions.
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.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".