Abstract
We introduce a new consensus protocol with delays for networks where the agents are using past information to anticipate their neighbours’ states. We consider directed and undirected networks under the proposed algorithm, and study the necessary and sufficient conditions for consensus reaching. We show how to tune the delay parameter for the proposed consensus protocol to obtain fast convergence speed for all connected networks. We prove that for all networks we can always find a set of parameters for the proposed algorithm and guarantee a convergence speed corresponding to dominant root −1. Moreover, we argue that our algorithm can increase the convergence speed, especially in badly connected networks (networks with few connections). We also give some insights into the optimality of our choice of delay parameter and demonstrate that it represents an optimal choice.
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.
