Credible Interdiction for Transmission Systems

DOI10.1109/TCNS.2021.3050128MaRDI QIDQ6317374zbMATH OpenFDO

Authors Kaarthik Sundar, Sidhant Misra, Russell Bent, Feng Pan

Publication date 17 April 2019

Full work available at URL https://doi.org/10.1109/TCNS.2021.3050128

Abstract: This paper presents novel formulations and algorithms for $N$-$k$ interdiction problem in transmission networks. In particular, it formulates spatial and topological resource constraints on attackers for $N$-$k$ interdiction problems and illustrates the formulation with two new classes of $N$-$k$ attacks: (i) Spatial $N$-$k$ attacks where the attack is constrained by geographic distance of a bus chosen by an attacker and (ii) Topological $N$-$k$ attacks where the attack is constrained to connected components. These two specific types of $N$-$k$ attacks compute interdiction plans designed to better model localized attacks, such as those induced by natural disasters or physical attacks. We then formulate these two resource-constrained interdiction problems as bilevel, max-min optimization problems and present a novel constraint generation algorithm to solve these formulations. Detailed case studies analyzing the behavior of spatially and topologically resource-constrained problems and comparing them to the traditional $N$-$k$ interdiction problem are also presented.

This page was built for publication: Credible Interdiction for Transmission Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6317374)