Abstract
In this paper we prove the following new and unexpected result: it is possible to design a continuous-time distributed filter for linear systems that asymptotically tends at each node to the optimal centralized filter. The result concerns distributed estimation over a connected undirected graph and it only requires to exchange the estimates among adjacent nodes. We exhibit an algorithm containing a consensus term with a parametrized gain and show that when the parameter becomes arbitrarily large the error covariance at each node becomes arbitrarily close to the error covariance of the optimal centralized Kalman filter.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
