Fast AI-Based Power Flow Analysis for High-Dimensional Electric Networks
Bibliographic record
Abstract
It is not revealing a secret to say that most of the power system studies highly depend on power flow (PF) analysis. This tool provides a frozen picture of dynamic electric networks under certain conditions. Nowadays, many iterative techniques are available to solve PF problems. The most popular one is built based on the Newton-Raphson (NR) algorithm. Although NR can obtain highly accurate solutions, its processing speed significantly decreases as the problem dimension increases. Thus, a wise selection should be taken to compromise between the processing speed and the solution accuracy. For some critical studies, such as contingency analysis, the processing speed is a very important factor that forces some energy management systems (EMS) to apply DC and AC-DC approximations. This paper studies the processing speed when artificial neural networks (ANNs) are adopted to solve PF problems. First, the standard 9-bus test system is used. Then, the processing speed of ANNs is examined through a very large virtual network. This AI-based technique can hit multiple birds with one stone. Adding to the processing speed and the solution accuracy, it can also solve the uncertainty issue by feeding ANNs with actual PF readings measured from some mounted instrument devices.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.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.
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".