Abstract
In this paper an algorithm for decentralized estimation of parameters in linear discrete-time regression models is proposed in the form of a combination of local stochastic approximation algorithms and a global consensus strategy. A rigorous analysis of the asymptotic properties of the proposed algorithm is presented, taking into account both the multi-agent network structure and the probabilities of local measurements and communication faults. In the case of non-vanishing gains in the stochastic approximation algorithms, an upper bound of the mean-square estimation error matrix is defined as a solution of a Lyapunov-like matrix equation, while in the case of asymptotically vanishing gains the mean-square convergence is proved. It is also demonstrated how the consensus strategy can contribute to the reduction of measurement noise influence.
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.
