The observability radius of network systems

Gianluca Bianchin; Paolo Frasca; Andrea Gasparri; Fabio Pasqualetti

doi:10.1109/ACC.2016.7524913

The observability radius of network systems

Gianluca Bianchin, Paolo Frasca, Andrea Gasparri, Fabio Pasqualetti

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

4 Citations (Scopus)

Abstract

This paper introduces the observability radius of network systems, which measures the robustness of a network to perturbations of the edges. We consider linear networks, where the dynamics are described by a weighted adjacency matrix, and dedicated sensors are positioned at a subset of nodes. We allow for perturbations of certain edge weights, with the objective of preventing observability of some modes of the network dynamics. Our work considers perturbations with a desired sparsity structure, thus extending the classic literature on the controllability and observability radius of linear systems. We propose an optimization framework to determine a perturbation with smallest Frobenius norm that renders a desired mode unobservable from a given set of sensor nodes. We derive optimality conditions and a heuristic optimization algorithm, which we validate through an example.

Original language	English
Title of host publication	American Control Conference (ACC), 2016
Place of Publication	Piscataway, NJ, USA
Publisher	IEEE
Pages	185-190
Number of pages	6
ISBN (Print)	978-1-4673-8683-8
DOIs	https://doi.org/10.1109/ACC.2016.7524913
Publication status	Published - 6 Jul 2016
Event	2016 American Control Conference, ACC 2016 - Boston, United States Duration: 6 Jul 2016 → 8 Jul 2016

Publication series

Name
Publisher	IEEE
ISSN (Print)	2378-5861

Conference

Conference	2016 American Control Conference, ACC 2016
Abbreviated title	ACC
Country	United States
City	Boston
Period	6/07/16 → 8/07/16

Keywords

EWI-27422
IR-102387
METIS-319481

Access to Document

10.1109/ACC.2016.7524913

Fingerprint Dive into the research topics of 'The observability radius of network systems'. Together they form a unique fingerprint.

Cite this

Bianchin, G., Frasca, P., Gasparri, A., & Pasqualetti, F. (2016). The observability radius of network systems. In American Control Conference (ACC), 2016 (pp. 185-190). Piscataway, NJ, USA: IEEE. https://doi.org/10.1109/ACC.2016.7524913

@inproceedings{06ef71bf8e3f427e807b802bae12f33b,

title = "The observability radius of network systems",

abstract = "This paper introduces the observability radius of network systems, which measures the robustness of a network to perturbations of the edges. We consider linear networks, where the dynamics are described by a weighted adjacency matrix, and dedicated sensors are positioned at a subset of nodes. We allow for perturbations of certain edge weights, with the objective of preventing observability of some modes of the network dynamics. Our work considers perturbations with a desired sparsity structure, thus extending the classic literature on the controllability and observability radius of linear systems. We propose an optimization framework to determine a perturbation with smallest Frobenius norm that renders a desired mode unobservable from a given set of sensor nodes. We derive optimality conditions and a heuristic optimization algorithm, which we validate through an example.",

keywords = "EWI-27422, IR-102387, METIS-319481",

author = "Gianluca Bianchin and Paolo Frasca and Andrea Gasparri and Fabio Pasqualetti",

year = "2016",

month = "7",

day = "6",

doi = "10.1109/ACC.2016.7524913",

language = "English",

isbn = "978-1-4673-8683-8",

publisher = "IEEE",

pages = "185--190",

booktitle = "American Control Conference (ACC), 2016",

address = "United States",

}

TY - GEN

T1 - The observability radius of network systems

AU - Bianchin, Gianluca

AU - Frasca, Paolo

AU - Gasparri, Andrea

AU - Pasqualetti, Fabio

PY - 2016/7/6

Y1 - 2016/7/6

N2 - This paper introduces the observability radius of network systems, which measures the robustness of a network to perturbations of the edges. We consider linear networks, where the dynamics are described by a weighted adjacency matrix, and dedicated sensors are positioned at a subset of nodes. We allow for perturbations of certain edge weights, with the objective of preventing observability of some modes of the network dynamics. Our work considers perturbations with a desired sparsity structure, thus extending the classic literature on the controllability and observability radius of linear systems. We propose an optimization framework to determine a perturbation with smallest Frobenius norm that renders a desired mode unobservable from a given set of sensor nodes. We derive optimality conditions and a heuristic optimization algorithm, which we validate through an example.

AB - This paper introduces the observability radius of network systems, which measures the robustness of a network to perturbations of the edges. We consider linear networks, where the dynamics are described by a weighted adjacency matrix, and dedicated sensors are positioned at a subset of nodes. We allow for perturbations of certain edge weights, with the objective of preventing observability of some modes of the network dynamics. Our work considers perturbations with a desired sparsity structure, thus extending the classic literature on the controllability and observability radius of linear systems. We propose an optimization framework to determine a perturbation with smallest Frobenius norm that renders a desired mode unobservable from a given set of sensor nodes. We derive optimality conditions and a heuristic optimization algorithm, which we validate through an example.

KW - EWI-27422

KW - IR-102387

KW - METIS-319481

U2 - 10.1109/ACC.2016.7524913

DO - 10.1109/ACC.2016.7524913

M3 - Conference contribution

SN - 978-1-4673-8683-8

SP - 185

EP - 190

BT - American Control Conference (ACC), 2016

PB - IEEE

CY - Piscataway, NJ, USA

ER -