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

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Dwivedi, Anmol, Tajer, Ali
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913733567053824
author Dwivedi, Anmol
Tajer, Ali
author_facet Dwivedi, Anmol
Tajer, Ali
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2503_09775
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Real-Time Risky Fault-Chain Search using Time-Varying Graph RNNs
Dwivedi, Anmol
Tajer, Ali
Machine Learning
Systems and Control
Signal Processing
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.
title Real-Time Risky Fault-Chain Search using Time-Varying Graph RNNs
topic Machine Learning
Systems and Control
Signal Processing
url https://arxiv.org/abs/2503.09775