Identifiability of linear dynamic networks

Research output: Contribution to journalArticleAcademicpeer-review

23 Citations (Scopus)
4 Downloads (Pure)

Abstract

Dynamic networks are structured interconnections of dynamical systems (modules) driven by external excitation and disturbance signals. In order to identify their dynamical properties and/or their topology consistently from measured data, we need to make sure that the network model set is identifiable. We introduce the notion of network identifiability, as a property of a parametrized model set, that ensures that different network models can be distinguished from each other when performing identification on the basis of measured data. Different from the classical notion of (parameter) identifiability, we focus on the distinction between network models in terms of their transfer functions. For a given structured model set with a pre-chosen topology, identifiability typically requires conditions on the presence and location of excitation signals, and on presence, location and correlation of disturbance signals. Because in a dynamic network, disturbances cannot always be considered to be of full-rank, the reduced-rank situation is also covered, meaning that the number of driving white noise processes can be strictly less than the number of disturbance variables. This includes the situation of having noise-free nodes.

Original languageEnglish
Pages (from-to)247-258
Number of pages12
JournalAutomatica
Volume89
DOIs
Publication statusPublished - 1 Mar 2018

Keywords

  • Algebraic loops
  • Dynamic networks
  • Identifiability
  • Singular spectrum
  • System identification

Fingerprint Dive into the research topics of 'Identifiability of linear dynamic networks'. Together they form a unique fingerprint.

Cite this