Pith. sign in

REVIEW 2 cited by

Hierarchical Reinforcement Learning for Power Network Topology Control

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.02129 v1 pith:Z7I3MRL4 submitted 2023-11-03 cs.LG cs.AIcs.SYeess.SY

Hierarchical Reinforcement Learning for Power Network Topology Control

classification cs.LG cs.AIcs.SYeess.SY
keywords levelpoweractionnetworkagentslearningchallengeconsists
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Learning in high-dimensional action spaces is a key challenge in applying reinforcement learning (RL) to real-world systems. In this paper, we study the possibility of controlling power networks using RL methods. Power networks are critical infrastructures that are complex to control. In particular, the combinatorial nature of the action space poses a challenge to both conventional optimizers and learned controllers. Hierarchical reinforcement learning (HRL) represents one approach to address this challenge. More precisely, a HRL framework for power network topology control is proposed. The HRL framework consists of three levels of action abstraction. At the highest level, there is the overall long-term task of power network operation, namely, keeping the power grid state within security constraints at all times, which is decomposed into two temporally extended actions: 'do nothing' versus 'propose a topology change'. At the intermediate level, the action space consists of all controllable substations. Finally, at the lowest level, the action space consists of all configurations of the chosen substation. By employing this HRL framework, several hierarchical power network agents are trained for the IEEE 14-bus network. Whereas at the highest level a purely rule-based policy is still chosen for all agents in this study, at the intermediate level the policy is trained using different state-of-the-art RL algorithms. At the lowest level, either an RL algorithm or a greedy algorithm is used. The performance of the different 3-level agents is compared with standard baseline (RL or greedy) approaches. A key finding is that the 3-level agent that employs RL both at the intermediate and the lowest level outperforms all other agents on the most difficult task. Our code is publicly available.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Hierarchical Multi-Agent Reinforcement Learning for Carbon-Aware AI Data Centers in Power Distribution Systems

    eess.SY 2026-07 conditional novelty 6.0

    Hierarchical MAT-based multi-agent RL with CEF nodal carbon intensity coordinates spatial job placement, temporal training shifts, GPU allocation, and cooling for low-carbon AI data centers on an IEEE 33-node grid.

  2. Power Grid Control with Graph-Based Distributed Reinforcement Learning

    cs.LG 2025-09 conditional novelty 6.0

    A two-layer distributed RL system with one GNN-observing agent per power line and a learned manager keeps the Grid2Op case14 grid alive far longer than the do-nothing baseline.