Power Flow Benchmarks

Yongzhe Li, L. Guan, Zihan Cai, Zuxian Lin, Jiyu Huang, Liukai Chen

Main figure for Power Flow Benchmarks

Abstract

Developing deep learning models with strong adaptability to topological variations is of great practical significance for power flow analysis. To enhance model performance under variable system scales and improve robustness in branch power prediction, this paper proposes a cale- daptive ulti-task ower low nalysis (SaMPFA) framework. SaMPFA introduces a Local Topology Slicing (LTS) sampling technique that extracts subgraphs of different scales from the complete power network to strengthen the model's cross-scale learning capability. Furthermore, a Reference-free Multi-task Graph Learning (RMGL) model is designed for robust power flow prediction. Unlike existing approaches, RMGL predicts bus voltages and branch powers instead of phase angles. This design not only avoids the risk of error amplification in branch power calculation but also guides the model to learn the physical relationships of phase angle differences. In addition, the loss function incorporates extra terms that encourage the model to capture the physical patterns of angle differences and power transmission, further improving consistency between predictions and physical laws. Simulations on the IEEE 39-bus system and a real provincial grid in China demonstrate that the proposed model achieves superior adaptability and generalization under variable system scales, with accuracy improvements of 4.47\

Proposed method: RMGL

Benchmark Results

Tested on 2 datasets

Tables show presented results in global context (best 3 papers + GCN + MLP).

Power Flow Benchmarks

#ModelAccuracy ↑Paper
1
RMGL
0.9987
This paper
2
MGL
0.9964
This paper
3
GLR
0.9963
This paper
4
GLP
0.9954
This paper
#ModelAccuracy ↑Paper
1
RMGL
0.9928
This paper
2
MGL
0.9607
This paper
3
GLP
0.5072
This paper
4
GLR
0.4709
This paper
SOTA performance (not significantly different from the best) Proposed method (this paper) Baseline / comparison (this paper)