Data-informativity conditions for structured linear systems with implications for dynamic networks

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Hof, Paul M. J. Van den, Shi, Shengling, Fonken, Stefanie J. M., Ramaswamy, Karthik R., Hjalmarsson, Håkan, Dankers, Arne G.
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911366536757248
author Hof, Paul M. J. Van den
Shi, Shengling
Fonken, Stefanie J. M.
Ramaswamy, Karthik R.
Hjalmarsson, Håkan
Dankers, Arne G.
author_facet Hof, Paul M. J. Van den
Shi, Shengling
Fonken, Stefanie J. M.
Ramaswamy, Karthik R.
Hjalmarsson, Håkan
Dankers, Arne G.
contents When estimating a single subsystem (module) in a linear dynamic network with a prediction error method, a data-informativity condition needs to be satisfied for arriving at a consistent module estimate. This concerns a condition on input signals in the constructed, possibly MIMO (multiple input multiple output) predictor model being persistently exciting, which is typically guaranteed if the input spectrum is positive definite for a sufficient number of frequencies. Generically, the condition can be formulated as a path-based condition on the graph of the network model. The current condition has two elements of possible conservatism: (a) rather than focussing on the full MIMO model, one would like to be able to focus on consistently estimating the target module only, and (b) structural information, such as structural zero elements in the interconnection structure or known subsystems, should be taken into account. In this paper relaxed conditions for data-informativity are derived addressing these two issues, leading to relaxed path-based conditions on the network graph. This leads to experimental conditions that are less strict, i.e. require a smaller number of external excitation signals. Additionally, the new expressions for data-informativity in identification are shown to be closely related to earlier derived conditions for (generic) single module identifiability.
format Preprint
id arxiv_https___arxiv_org_abs_2409_03883
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Data-informativity conditions for structured linear systems with implications for dynamic networks
Hof, Paul M. J. Van den
Shi, Shengling
Fonken, Stefanie J. M.
Ramaswamy, Karthik R.
Hjalmarsson, Håkan
Dankers, Arne G.
Systems and Control
When estimating a single subsystem (module) in a linear dynamic network with a prediction error method, a data-informativity condition needs to be satisfied for arriving at a consistent module estimate. This concerns a condition on input signals in the constructed, possibly MIMO (multiple input multiple output) predictor model being persistently exciting, which is typically guaranteed if the input spectrum is positive definite for a sufficient number of frequencies. Generically, the condition can be formulated as a path-based condition on the graph of the network model. The current condition has two elements of possible conservatism: (a) rather than focussing on the full MIMO model, one would like to be able to focus on consistently estimating the target module only, and (b) structural information, such as structural zero elements in the interconnection structure or known subsystems, should be taken into account. In this paper relaxed conditions for data-informativity are derived addressing these two issues, leading to relaxed path-based conditions on the network graph. This leads to experimental conditions that are less strict, i.e. require a smaller number of external excitation signals. Additionally, the new expressions for data-informativity in identification are shown to be closely related to earlier derived conditions for (generic) single module identifiability.
title Data-informativity conditions for structured linear systems with implications for dynamic networks
topic Systems and Control
url https://arxiv.org/abs/2409.03883