TL;DR
This paper explores the graph-theoretic conditions for target controllability and observability in structured network systems, establishing a duality that enables efficient sensor and driver placement for large-scale networks.
Contribution
It characterizes the conditions for target controllability and observability, establishing a duality that allows methods for one to be applied to the other in structured systems.
Findings
Graph-theoretic conditions for target controllability and observability are established.
A duality between these properties is rigorously proven.
Efficient algorithms for sensor and driver placement are applicable when properties are strongly dual.
Abstract
The duality between controllability and observability enables methods developed for full-state control to be applied to full-state estimation, and vice versa. In applications in which control or estimation of all state variables is unfeasible, the generalized notions of output controllability and functional observability establish the minimal conditions for the control and estimation of a target subset of state variables, respectively. Given the seemly unrelated nature of these properties, thus far methods for target control and target estimation have been developed independently in the literature. Here, we characterize the graph-theoretic conditions for target controllability and target observability (which are, respectively, special cases of output controllability and functional observability for structured systems). This allow us to rigorously establish a weak and strong duality…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
