no code implementations • 17 Sep 2021 • Yanwen Mao, Paulo Tabuada
This motivates a 2-step solution to the decentralized secure state-tracking problem: (1) each node tracks the compressed version of all the network measurements, and (2) each node asymptotically reconstructs the state from the output of step (1).
no code implementations • 6 Jan 2021 • Yanwen Mao, Aritra Mitra, Shreyas Sundaram, Paulo Tabuada
To better understand this, we show that when the $\mathbf{A}$ matrix of the linear system has unitary geometric multiplicity, the gap disappears, i. e., eigenvalue observability coincides with sparse observability, and there exists a polynomial time algorithm to reconstruct the state provided the state can be reconstructed.