The observability radius of network systems

Bianchin, Gianluca;Frasca, Paolo;Gasparri, Andrea;Pasqualetti, Fabio
(2016) 2016 American Control Conference (ACC) — Location: Boston, MA, USA (6.July.2016)

Files

GB-PF-AG-FP-16-acc.pdf
  • Open Access
  • Adobe PDF
  • 451.32 KB

Details

Authors
  • Author
  • Frasca, Paolo
    Author
  • Gasparri, Andrea
    Author
  • Pasqualetti, Fabio
    Author
Abstract
(en) 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.
Affiliations

Citations

Bianchin, G., Frasca, P., Gasparri, A., & Pasqualetti, F. (2016). The observability radius of network systems. IEEE Xplore. Published. 2016 American Control Conference (ACC), Boston, MA, USA. https://doi.org/10.1109/acc.2016.7524913