1. Identifiability of linear dynamic networks through switching modules
- Author
-
H.J. Dreef, M.C.F. Donkers, and P.M.J. Van den Hof
- Subjects
Computer science ,Dynamic networks ,Topology (electrical circuits) ,Topology ,Set (abstract data type) ,Identification (information) ,identiability ,Control and Systems Engineering ,switching systems ,Path (graph theory) ,Graph (abstract data type) ,Identifiability ,Verifiable secret sharing ,System identification ,system identication ,Network model - Abstract
Identifiability of linear dynamic networks typically depends on the presence and location of external (excitation or disturbance) signals, in relation to the topology of the parametrized network model set. For closed-loop identification, it is known that switching (non-parameterized) controllers can also provide excitation, thereby rendering the model set identifiable. In this paper, we derive verifiable conditions for network identifiability of the non-switching modules in presence of (non-parameterized) switching modules. These conditions generalize the classical result in closed-loop identification towards network identification. Furthermore, verifiable path-based conditions for identifiability in a generic sense are developed on the graph of the network model set.
- Published
- 2021
- Full Text
- View/download PDF