Distributed partial state estimation for linear state-space systems
Juhi Jaiswal, Thomas Berger, Nutan Kumar Tomar

TL;DR
This paper develops a rank-based criterion for partial state estimation in distributed linear systems, providing a simple design method and demonstrating its effectiveness through a numerical example.
Contribution
It establishes a necessary and sufficient rank condition for distributed partial state estimation in LTI systems, along with a straightforward design algorithm.
Findings
The rank criterion guarantees the feasibility of partial state estimation.
The proposed method is applicable to directed, balanced, strongly connected, or undirected, connected communication graphs.
Numerical example confirms the effectiveness of the theoretical results and design approach.
Abstract
This study is concerned with the problem of partial state estimation for linear time-invariant (LTI) distributed state-space systems. A necessary and sufficient condition is established in terms of a simple rank criterion involving the system coefficient matrices, provided the communication graph is either directed, balanced and strongly connected or undirected and connected. The estimator parameter matrices are obtained by simple matrix theory. Finally, a numerical example demonstrates the feasibility and effectiveness of the proposed theoretical results and design algorithm.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
