English

Real-Time Risky Fault-Chain Search using Time-Varying Graph RNNs

Machine Learning 2025-03-14 v1 Systems and Control Signal Processing Systems and Control

Abstract

This paper introduces a data-driven graphical framework for the real-time search of risky cascading fault chains (FCs) in power-grids, crucial for enhancing grid resiliency in the face of climate change. As extreme weather events driven by climate change increase, identifying risky FCs becomes crucial for mitigating cascading failures and ensuring grid stability. However, the complexity of the spatio-temporal dependencies among grid components and the exponential growth of the search space with system size pose significant challenges to modeling and risky FC search. To tackle this, we model the search process as a partially observable Markov decision process (POMDP), which is subsequently solved via a time-varying graph recurrent neural network (GRNN). This approach captures the spatial and temporal structure induced by the system's topology and dynamics, while efficiently summarizing the system's history in the GRNN's latent space, enabling scalable and effective identification of risky FCs.

Keywords

Cite

@article{arxiv.2503.09775,
  title  = {Real-Time Risky Fault-Chain Search using Time-Varying Graph RNNs},
  author = {Anmol Dwivedi and Ali Tajer},
  journal= {arXiv preprint arXiv:2503.09775},
  year   = {2025}
}

Comments

arXiv admin note: substantial text overlap with arXiv:2303.08864

R2 v1 2026-06-28T22:18:10.342Z