Abstract
For time-delay, noise and network congestion in the communication among agents, there are often random communication link failures among agents. In this paper, we analyze the pseudo two-hop distributed consensus algorithm with link failures, and research the relation between convergence performance and the probability of link failures. Supposing that the probability of link failures in every link is independent identically distributed, we analyze the convergence performance of the pseudo two-hop distributed consensus algorithm with link failures, and simulation results are provided to verify these analytical 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.
