Abstract

This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The protocols taken into account adopt an updating rule based either on constant or vanishing weights. The bounded error assumption allows one to cast the consensus problem in a set-membership framework, and to study the team agreement in terms of the evolution of the feasible state set. It is shown that consensus cannot be guaranteed with respect to all possible noise realizations. Moreover, bounds on the asymptotic difference between the states of the agents are explicitly derived, in terms of the bounds on the measurement noise and the eigenvalues of the weight matrix.

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 call

Disclaimer: 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.