TL;DR
This paper introduces a graph-based theory of functional observability for large-scale networks, enabling targeted state estimation with fewer sensors and computational resources, demonstrated through power grid and epidemic applications.
Contribution
It develops scalable algorithms for minimal sensor placement and low-order functional observer design in large networks, addressing high-dimensionality challenges.
Findings
Functional observability allows targeted state reconstruction with fewer sensors.
Proposed methods scale to large networks and reduce computational complexity.
Applications include cyber-attack detection and epidemic prevalence estimation.
Abstract
The quantitative understanding and precise control of complex dynamical systems can only be achieved by observing their internal states via measurement and/or estimation. In large-scale dynamical networks, it is often difficult or physically impossible to have enough sensor nodes to make the system fully observable. Even if the system is in principle observable, high-dimensionality poses fundamental limits on the computational tractability and performance of a full-state observer. To overcome the curse of dimensionality, we instead require the system to be functionally observable, meaning that a targeted subset of state variables can be reconstructed from the available measurements. Here, we develop a graph-based theory of functional observability, which leads to highly scalable algorithms to i) determine the minimal set of required sensors and ii) design the corresponding state…
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.
