Laplacian Matrix-Based Power Flow Formulation for LVDC Grids with Radial and Meshed Configurations
Bibliographic record
Abstract
There is an increasing interest in low voltage direct current (LVDC) distribution grids due to advancements in power electronics enabling efficient and economical electrical networks in the DC paradigm. Power flow equations in LVDC grids are non-linear and non-convex due to the presence of constant power nodes. Depending on the implementation, power flow equations may lead to more than one solution and unrealistic solutions; therefore, the uniqueness of the solution should not be taken for granted. This paper proposes a new power flow solver based on a graph theory for LVDC grids having radial or meshed configurations. The solver provides a unique solution. Two test feeders composed of 33 nodes and 69 nodes are considered to validate the effectiveness of the proposed method. The proposed method is compared with a fixed-point methodology called direct load flow (DLF) having a mathematical formulation equivalent to a backward forward sweep (BFS) class of solvers in the case of radial distribution networks but that can handle meshed networks more easily thanks to the use of connectivity matrices. In addition, the convergence and uniqueness of the solution is demonstrated using a Banach fixed-point theorem. The performance of the proposed method is tested for different loading conditions. The results show that the proposed method is robust and has fast convergence characteristics even with high loading conditions. All simulations are carried out in MATLAB 2020b software.
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.000 |
| Bibliometrics | 0.000 | 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.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 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".