Sequential network‐flow based power‐flow method for hybrid power systems
Bibliographic record
Abstract
Abstract This paper presents a sequential network‐flow graph‐based method for a steady‐state power flow solution in hybrid multi‐terminal power systems. The proposed method is a unique and novel one, which differs from other established methods that involve the use of modified versions of classical power flow methods. The proposed method formulates a power flow problem as a maximum network‐flow problem and solves it using a push‐relabel max‐flow algorithm. The solution procedure solves AC and DC parts sequentially, while accounting for voltage source converter losses using a generalised converter model. The proposed flow‐Augmenting method solves the power flow problem using matrix vector multiplication in its most abstract form, and it is independent of system parameters and network configuration. The proposed formulation is computationally efficient, as it is based on matrix vector multiplication, and is scalable, because the formulation works as a graph‐based method, which, inherently, allows for parallel computation for added computational speed. Further, unlike previously reported methods, the proposed method does not rely on Jacobian matrix formulation or any matrix inversion. This proves to be a strong advantage for the proposed method, as a significant reduction in computational time is observed, as a result. The proposed method is validated on 5‐bus hybrid system and CIGRE B4 DC system.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.010 | 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".