On optimal link removals for controllability degradation in dynamical networks

Makan Fardad; Amit Diwadkar; Umesh Vaidya

doi:10.1109/CDC.2014.7039430

On optimal link removals for controllability degradation in dynamical networks

Makan Fardad, Amit Diwadkar, Umesh Vaidya

Department of Electrical Engineering & Computer Science

Research output: Contribution to journal › Article

4 Scopus citations

Abstract

We consider the problem of controllability degradation in dynamical networks subjected to malicious attacks. Attacks on the networks are assumed to be in the form of the removal of interconnection links. We formulate an optimization problem that seeks sets of links whose removal causes maximal degradation in the rank of the controllability gramian. We apply the alternating direction method of multipliers and sequential convex programming to find local solutions to this combinatorial optimization problem. We provide illustrative examples to demonstrate the utility of our results.

Original language	English (US)
Article number	7039430
Pages (from-to)	499-504
Number of pages	6
Journal	Unknown Journal
Volume	2015-February
Issue number	February
DOIs	https://doi.org/10.1109/CDC.2014.7039430
State	Published - 2014

Fingerprint

Keywords

Alternating direction method of multipliers (ADMM)
cyber-physical systems
link failure
rank minimization
sequential convex programming

ASJC Scopus subject areas

Control and Systems Engineering
Modeling and Simulation
Control and Optimization

Cite this

Fardad, M., Diwadkar, A., & Vaidya, U. (2014). On optimal link removals for controllability degradation in dynamical networks. Unknown Journal, 2015-February(February), 499-504. [7039430]. https://doi.org/10.1109/CDC.2014.7039430

@article{8f3bb4f1ba474628a3d40c6c4b0803cd,

title = "On optimal link removals for controllability degradation in dynamical networks",

abstract = "We consider the problem of controllability degradation in dynamical networks subjected to malicious attacks. Attacks on the networks are assumed to be in the form of the removal of interconnection links. We formulate an optimization problem that seeks sets of links whose removal causes maximal degradation in the rank of the controllability gramian. We apply the alternating direction method of multipliers and sequential convex programming to find local solutions to this combinatorial optimization problem. We provide illustrative examples to demonstrate the utility of our results.",

keywords = "Alternating direction method of multipliers (ADMM), cyber-physical systems, link failure, rank minimization, sequential convex programming",

author = "Makan Fardad and Amit Diwadkar and Umesh Vaidya",

year = "2014",

doi = "10.1109/CDC.2014.7039430",

language = "English (US)",

volume = "2015-February",

pages = "499--504",

journal = "Nuclear Physics A",

issn = "0375-9474",

publisher = "Elsevier",

number = "February",

}

TY - JOUR

T1 - On optimal link removals for controllability degradation in dynamical networks

AU - Fardad, Makan

AU - Diwadkar, Amit

AU - Vaidya, Umesh

PY - 2014

Y1 - 2014

N2 - We consider the problem of controllability degradation in dynamical networks subjected to malicious attacks. Attacks on the networks are assumed to be in the form of the removal of interconnection links. We formulate an optimization problem that seeks sets of links whose removal causes maximal degradation in the rank of the controllability gramian. We apply the alternating direction method of multipliers and sequential convex programming to find local solutions to this combinatorial optimization problem. We provide illustrative examples to demonstrate the utility of our results.

AB - We consider the problem of controllability degradation in dynamical networks subjected to malicious attacks. Attacks on the networks are assumed to be in the form of the removal of interconnection links. We formulate an optimization problem that seeks sets of links whose removal causes maximal degradation in the rank of the controllability gramian. We apply the alternating direction method of multipliers and sequential convex programming to find local solutions to this combinatorial optimization problem. We provide illustrative examples to demonstrate the utility of our results.

KW - Alternating direction method of multipliers (ADMM)

KW - cyber-physical systems

KW - link failure

KW - rank minimization

KW - sequential convex programming

UR - http://www.scopus.com/inward/record.url?scp=84988045121&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84988045121&partnerID=8YFLogxK

U2 - 10.1109/CDC.2014.7039430

DO - 10.1109/CDC.2014.7039430

M3 - Article

AN - SCOPUS:84988045121

VL - 2015-February

SP - 499

EP - 504

JO - Nuclear Physics A

JF - Nuclear Physics A

SN - 0375-9474

IS - February

M1 - 7039430

ER -

Access to Document

10.1109/CDC.2014.7039430