Abstract
Distributed estimation schemes are increasingly popular these days. A distributed algorithm, specifically tailored to recursive set membership estimation problems, was recently proposed and analyzed for networks featuring a static topology. It was shown that the agents’ estimates asymptotically converge to a common point lying in the intersection of all the agents’ feasible sets. In this paper, by building on recent results on constrained consensus, we prove convergence in the more challenging scenario of networks with time-varying topology. It is shown that convergence is guaranteed if the sequence of graphs is jointly strongly connected over finite-length time intervals. Moreover, an asynchronous version of the proposed algorithm is presented, whose convergence can be deduced from the previously obtained results.
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.
