Pith. sign in

REVIEW 1 cited by

Guiding Cascading Failure Search with Interpretable Graph Convolutional Network

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 2001.11553 v1 pith:AK57MNEF submitted 2020-01-30 eess.SP cs.SYeess.SY

classification eess.SPcs.SYeess.SY
keywords cascadingfailuresnetworksearchsystemcomplexpowerconvolutional
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Power system cascading failures become more time variant and complex because of the increasing network interconnection and higher renewable energy penetration. High computational cost is the main obstacle for a more frequent online cascading failure search, which is essential to improve system security. In this work, we show that the complex mechanism of cascading failures can be well captured by training a graph convolutional network (GCN) offline. Subsequently, the search of cascading failures can be significantly accelerated with the aid of the trained GCN model. We link the power network topology with the structure of the GCN, yielding a smaller parameter space to learn the complex mechanism. We further enable the interpretability of the GCN model by a layer-wise relevance propagation (LRP) algorithm. The proposed method is tested on both the IEEE RTS-79 test system and China's Henan Province power system. The results show that the GCN guided method can not only accelerate the search of cascading failures, but also reveal the reasons for predicting the potential cascading failures.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. AWB-GCN: A Graph Convolutional Network Accelerator with Runtime Workload Rebalancing

    cs.DC 2019-08 conditional novelty 7.0 of 10

    AWB-GCN uses three hardware runtime rebalancing techniques (distribution smoothing, remote switching, and evil row remapping) to raise processing-element utilization for irregular GCN workloads.

Pith tools