Abstract
A stopping rule is presented for a multiagent consensus algorithm with noisy communication. A stochastic approximation method is employed and the relation between the closeness of the agreement and the number of iterations is established. A bound of the variation of the agents at the specific number of iterations is then derived with a probabilistic guarantee, which gives a rigorous stopping rule of the consensus algorithm with noisy communication. This stopping rule is given in terms of characteristic values of communication network graphs, which suggests a difference in transient behaviors by undirected and directed graphs. These theoretical results are demonstrated through numerical examples.
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.
