Triple-Flow Dynamic Graph Convolutional Network for Wind Power Forecasting

Bin Li, Bo Ding, Wei Pang, Hongyin NiSymmetry 2025 · OpenReview

TL;DR

This paper introduces the Triple-Flow Dynamic Graph Convolutional Network (TFDGCN), a novel deep learning model designed to improve short-term wind power forecasting. By decoupling and processing temporal and spatial dependencies across three distinct "flows" (variable, time, and node), TFDGCN captures complex interrelationships more effectively than previous methods, leading to more accurate predictions.

What Problem Does This Paper Address?

Integrating wind energy into power grids is crucial for sustainability, but its intermittent and volatile nature poses significant challenges for grid stability and operational planning. Accurate wind power forecasting is essential to mitigate these challenges. Existing methods often struggle because they treat temporal and spatial characteristics of wind power data as a monolithic whole, ignoring the inherent differences and complexities in how variables, time, and physical locations (wind turbines) interact. This can limit the model's ability to learn nuanced patterns and reduce prediction accuracy.

Methods

The core innovation is the Triple-Flow Dynamic Graph Convolutional Network (TFDGCN). It employs a symmetric architecture with three parallel branches, each focusing on a different dimension of the data:

  • Variable Flow: Models dependencies between different variables (e.g., wind speed, direction, temperature) for a single wind turbine.
  • Time Flow: Captures temporal dependencies within a single variable's time series, breaking it into "patches" for better local feature extraction.
  • Node Flow: Represents spatial relationships between different wind turbines, considering environmental factors.

Each branch constructs dynamic sparse graphs based on cosine similarity, allowing the graph structure to adapt to changing conditions. These graphs are then processed by specialized graph convolutional networks (GCNs) for each flow. Finally, a linear attention mechanism with positional encodings (RoPE and LePE) is used to fuse the information from all three flows, enabling the model to capture global dependencies across all dimensions. This approach decouples the learning of different dependency types, aiming to prevent information entanglement and improve the model's expressive power.

Datasets

The study uses two real-world wind farm datasets:

  • SDWPF: A large dataset from Longyuan Power Group, containing over 4.7 million records from 134 wind turbines, with detailed environmental and state features.
  • SD23: A dataset from a wind farm in Shandong Province, China, with over 2.1 million records from 45 wind turbines, including wind speed, yaw angle, and actual power.

Both datasets were used for short-term forecasting, predicting wind power for the next day based on past data.

Key Insights and Ideas

  • Decoupling is Key: The paper argues that treating temporal and spatial dependencies as fundamentally different and learning them separately (via the triple-flow architecture) is more effective than joint modeling, which can lead to information entanglement.
  • Dynamic Graphs Matter: Static graph structures based on fixed relationships (like distance) are insufficient. Dynamic graphs that adapt to changing environmental conditions (wind speed, direction) better reflect the true spatial correlations between turbines.
  • Sparse Graphs for Efficiency: Constructing sparse graphs based on cosine similarity not only captures relevant relationships but also reduces computational complexity compared to dense graphs.
  • Linear Attention for Global Context: The linear attention mechanism, combined with positional encodings, effectively aggregates information from the three distinct flows to capture long-range dependencies without the quadratic complexity of standard self-attention.

Key Results

The proposed TFDGCN model demonstrated superior performance compared to several state-of-the-art methods on both datasets.

  • On the SDWPF dataset, TFDGCN achieved a Mean Absolute Error (MAE) of 37.16 MW and a Root Mean Square Error (RMSE) of 44.84 MW.
  • On the SD23 dataset, TFDGCN achieved an MAE of 14.63 MW and an RMSE of 17.56 MW.

Ablation studies confirmed the effectiveness of the triple-flow structure, showing performance degradation when any flow was removed. Replacing the dynamic node graph with a static one also reduced performance, highlighting the importance of dynamic graph modeling. The linear attention mechanism was also shown to be crucial for capturing global dependencies and contributed to improved performance and faster inference times compared to global attention.

Limitations and Future Work

  • Limitations: The paper acknowledges that while dynamic graphs improve performance, they can still lead to fluctuations in prediction stability. The study also focuses on short-term forecasting; extending to medium and long-term predictions could be explored.
  • Future Work: The authors suggest investigating the synergistic effect between wind power forecasting and power dispatch optimization to further reduce grid operating costs and enhance system stability. They also plan to explore the application of their model to other spatiotemporal forecasting tasks.

Summary updated

Abstract

Wind energy is a clean but intermittent and volatile energy source, and its large-scale integration into power systems poses great challenges to ensuring safe and stable operation and achieving scheduling optimization and effective energy planning of the power systems. Accurate wind power forecasting is an effective way to mitigate the impact of wind power instability on power systems. However, wind power data are often in the form of multivariate time series. Existing wind power forecasting research often directly models the temporal and spatial characteristics of coupled wind power time-series data, ignoring the heterogeneity of time and space, thereby limiting the model’s expressive power. To address the above problems, we propose a triple-flow dynamic graph convolutional network (TFDGCN) for short-term wind power forecasting. The proposed TFDGCN is a symmetric dynamic graph neural network with three branches. It decouples and learns features of three different dimensions: within a wind power variable sequence, between sequences, and between wind turbines. The proposed TFDGCN constructs dynamic sparse graphs based on cosine similarities within variable sequences, between variable sequences, and between wind turbine nodes, and feeds them into their respective dynamic graph convolution modules. Afterwards, TFDGCN utilizes linear attention encoders which fuse local position encoding (LePE) and rotational position encoding (RoPE) to learn global dependencies within variable sequences, between sequences, and between wind turbines, and provide prediction results. Extensive experimental results on two real-world datasets demonstrate that the proposed TFDGCN outperforms other state-of-the-art methods. On the SDWPF and SD23 datasets, the proposed TFDGCN achieved mean absolute error values of 37.16 and 14.63, respectively, as well as root mean square error values of 44.84 and 17.56, respectively.
BibTeX
@inproceedings{li2025triple,
  author = {Bin Li and Bo Ding and Wei Pang and Hongyin Ni},
  title = {{Triple-Flow Dynamic Graph Convolutional Network for Wind Power Forecasting}},
  booktitle = {Symmetry},
  year = {2025},
  url = {https://openreview.net/forum?id=XY4pL0GI9O},
}
Figure