Learning Topology Actions for Power Grid Control: A Graph-Based Soft-Label Imitation Learning Approach

• URL: http://arxiv.org/abs/2503.15190v1
• Date: Wed, 19 Mar 2025 13:21:18 GMT
• Title: Learning Topology Actions for Power Grid Control: A Graph-Based Soft-Label Imitation Learning Approach
• Authors: Mohamed Hassouna, Clara Holzhüter, Malte Lehna, Matthijs de Jong, Jan Viebahn, Bernhard Sick, Christoph Scholz,
• Abstract summary: We introduce a novel Imitation Learning (IL) approach to find suitable grid topologies for congestion management.<n>Unlike traditional IL methods that rely on hard labels to enforce a single optimal action, our method constructs soft labels over actions.<n>To further enhance decision-making, we integrate Graph Neural Networks (GNNs) to encode the structural properties of power grids.
• Score: 1.438236614765323
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The rising proportion of renewable energy in the electricity mix introduces significant operational challenges for power grid operators. Effective power grid management demands adaptive decision-making strategies capable of handling dynamic conditions. With the increase in complexity, more and more Deep Learning (DL) approaches have been proposed to find suitable grid topologies for congestion management. In this work, we contribute to this research by introducing a novel Imitation Learning (IL) approach that leverages soft labels derived from simulated topological action outcomes, thereby capturing multiple viable actions per state. Unlike traditional IL methods that rely on hard labels to enforce a single optimal action, our method constructs soft labels over actions, by leveraging effective actions that prove suitable in resolving grid congestion. To further enhance decision-making, we integrate Graph Neural Networks (GNNs) to encode the structural properties of power grids, ensuring that the topology-aware representations contribute to better agent performance. Our approach significantly outperforms state-of-the-art baselines, all of which use only topological actions, as well as feedforward and GNN-based architectures with hard labels. Most notably, it achieves a 17% better performance compared to the greedy expert agent from which the imitation targets were derived.

Related papers

• Graph-Enhanced Model-Free Reinforcement Learning Agents for Efficient Power Grid Topological Control [0.24578723416255752]
  This paper presents a novel approach within the model-free framework of reinforcement learning, aimed at optimizing power network operations without prior expert knowledge. We demonstrate that our approach achieves a consistent reduction in power losses, while ensuring grid stability against potential blackouts.
  arXiv  Detail & Related papers  (2025-03-26T16:20:30Z)
• DSMoE: Matrix-Partitioned Experts with Dynamic Routing for Computation-Efficient Dense LLMs [70.91804882618243]
  This paper proposes DSMoE, a novel approach that achieves sparsification by partitioning pre-trained FFN layers into computational blocks. We implement adaptive expert routing using sigmoid activation and straight-through estimators, enabling tokens to flexibly access different aspects of model knowledge. Experiments on LLaMA models demonstrate that under equivalent computational constraints, DSMoE achieves superior performance compared to existing pruning and MoE approaches.
  arXiv  Detail & Related papers  (2025-02-18T02:37:26Z)
• Graph Structure Refinement with Energy-based Contrastive Learning [56.957793274727514]
  We introduce an unsupervised method based on a joint of generative training and discriminative training to learn graph structure and representation. We propose an Energy-based Contrastive Learning (ECL) guided Graph Structure Refinement (GSR) framework, denoted as ECL-GSR. ECL-GSR achieves faster training with fewer samples and memories against the leading baseline, highlighting its simplicity and efficiency in downstream tasks.
  arXiv  Detail & Related papers  (2024-12-20T04:05:09Z)
• State and Action Factorization in Power Grids [47.65236082304256]
  We propose a domain-agnostic algorithm that estimates correlations between state and action components entirely based on data. The algorithm is validated on a power grid benchmark obtained with the Grid2Op simulator.
  arXiv  Detail & Related papers  (2024-09-03T15:00:58Z)
• Multi-Agent Reinforcement Learning for Power Control in Wireless Networks via Adaptive Graphs [1.1861167902268832]
  Multi-agent deep reinforcement learning (MADRL) has emerged as a promising method to address a wide range of complex optimization problems like power control. We present the use of graphs as communication-inducing structures among distributed agents as an effective means to mitigate these challenges.
  arXiv  Detail & Related papers  (2023-11-27T14:25:40Z)
• T-GAE: Transferable Graph Autoencoder for Network Alignment [79.89704126746204]
  T-GAE is a graph autoencoder framework that leverages transferability and stability of GNNs to achieve efficient network alignment without retraining. Our experiments demonstrate that T-GAE outperforms the state-of-the-art optimization method and the best GNN approach by up to 38.7% and 50.8%, respectively.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• Evaluating Distribution System Reliability with Hyperstructures Graph Convolutional Nets [74.51865676466056]
  We show how graph convolutional networks and hyperstructures representation learning framework can be employed for accurate, reliable, and computationally efficient distribution grid planning. Our numerical experiments show that the proposed Hyper-GCNNs approach yields substantial gains in computational efficiency.
  arXiv  Detail & Related papers  (2022-11-14T01:29:09Z)
• Solving AC Power Flow with Graph Neural Networks under Realistic Constraints [3.114162328765758]
  We propose a graph neural network architecture to solve the AC power flow problem under realistic constraints. In our approach, we demonstrate the development of a framework that uses graph neural networks to learn the physical constraints of the power flow.
  arXiv  Detail & Related papers  (2022-04-14T14:49:34Z)
• Graph-based Algorithm Unfolding for Energy-aware Power Allocation in Wireless Networks [27.600081147252155]
  We develop a novel graph sumable framework to maximize energy efficiency in wireless communication networks. We show the permutation training which is a desirable property for models of wireless network data. Results demonstrate its generalizability across different network topologies.
  arXiv  Detail & Related papers  (2022-01-27T20:23:24Z)
• Edge Rewiring Goes Neural: Boosting Network Resilience via Policy Gradient [62.660451283548724]
  ResiNet is a reinforcement learning framework to discover resilient network topologies against various disasters and attacks. We show that ResiNet achieves a near-optimal resilience gain on multiple graphs while balancing the utility, with a large margin compared to existing approaches.
  arXiv  Detail & Related papers  (2021-10-18T06:14:28Z)
• Soft Hierarchical Graph Recurrent Networks for Many-Agent Partially Observable Environments [9.067091068256747]
  We propose a novel network structure called hierarchical graph recurrent network(HGRN) for multi-agent cooperation under partial observability. Based on the above technologies, we proposed a value-based MADRL algorithm called Soft-HGRN and its actor-critic variant named SAC-HRGN.
  arXiv  Detail & Related papers  (2021-09-05T09:51:25Z)
• Dynamic Hierarchical Mimicking Towards Consistent Optimization Objectives [73.15276998621582]
  We propose a generic feature learning mechanism to advance CNN training with enhanced generalization ability. Partially inspired by DSN, we fork delicately designed side branches from the intermediate layers of a given neural network. Experiments on both category and instance recognition tasks demonstrate the substantial improvements of our proposed method.
  arXiv  Detail & Related papers  (2020-03-24T09:56:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.