Input and State Observability of Network Systems with a Single Unknown Input
Alain Y. Kibangou, Federica Garin, Sebin Gracy
Abstract
Alain Y. Kibangou, Federica Garin, Sebin Gracy
Abstract
This paper studies network systems affected by a single unknown input, possibly representing an attack or a failure, to be estimated. The main result is a characterization of input and state observability, namely the conditions under which both the whole network state and the unknown input can be reconstructed from some measured local states. This characterization is in terms of observability of a suitably-defined subsystem, which allows the use of known graphical charactizations of observability of network systems, leading to structural results (true for almost all interaction weights) or strong structural results (true for all non-zero interaction weights). We apply our results to an illustrative example, finding a full characterization of input and state observability of a path graph, affected by a single unknown input and with measurement of a small number of local states.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper studies network systems affected by a single unknown input, possibly representing an attack or a failure, to be estimated. The main result is a characterization of input and state observability, namely the conditions under which both the whole network state and the unknown input can be reconstructed from some measured local states. This characterization is in terms of observability of a suitably-defined subsystem, which allows the use of known graphical charactizations of observability of network systems, leading to structural results (true for almost all interaction weights) or strong structural results (true for all non-zero interaction weights). We apply our results to an illustrative example, finding a full characterization of input and state observability of a path graph, affected by a single unknown input and with measurement of a small number of local states.
Key concepts: Observability, State (computer science), Characterization (materials science), Graph, Control theory (sociology), Computer science, Mathematics, Topology (electrical circuits)