Abstract

Identifiability conditions for single or multiple modules in a dynamic network specify under which conditions the considered modules can be uniquely recovered from the second-order statistical properties of the measured signals. Conditions for generic identifiability of multiple modules, i.e. a subnetwork, are developed for the situation that all node signals are measured and excitation of the network is provided by both measured excitation signals and unmeasured disturbance inputs. Additionally, the network model set is allowed to contain non-parametrized modules that are fixed, and e.g. reflect modules of which the dynamics are known to the user. The conditions take the form of path-based conditions on the graph of the network model set. Based on these conditions, synthesis results are formulated for allocating external excitation signals to achieve generic identifiability of particular subnetworks. If there are a sufficient number of measured external excitation signals, the formulated results give rise to a generalized indirect type of identification algorithm that requires only the measurement of a subset of the node signals in the network.

Highlights

  • Due to the increasing complexity of current technological systems, the study of large-scale interconnected dynamic systems receives considerable attention [4, 19, 24]

  • When a subnetwork is not generically identifiable, we aim to develop graphical synthesis approaches that allocate additional excitation signals to automatically achieve the generic identifiability of a subnetwork

  • Generic identifiability of a subnetwork, i.e. a subset of modules, in linear dynamic networks has been investigated in the setting where all internal signals are measured

Read more

Summary

Introduction

Due to the increasing complexity of current technological systems, the study of large-scale interconnected dynamic systems receives considerable attention [4, 19, 24]. In this setting we will develop novel analysis tools for generic identifiability of subnetworks that are formulated in terms of disconnecting sets in the graph of the network models, and we will show that this leads to a new and effective synthesis procedure for allocating external excitation signals for achieving identifiability of a subnetwork. This synthesis problem was not addressed in [3, 18, 38, 40].

Dynamic networks
Model sets
Network identifiability
Problem formulation
Notations and definitions
Algebraic conditions for identifiability
Path-based conditions for generic identifiability
Generic identifiability based on disconnecting sets
Algebraic interpretation of disconnecting sets
Relation with the parallel path and loop condition
Signal allocation for generic identifiability
Indirect identification method
Duality
Conclusion
Proof for Proposition 3
Proof of Theorem 4
Proof of Proposition 4
Proof of Theorem 5
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call