Abstract

For third-order multi-agent system with time delay based on fixed undirected networks, a theoretical condition is given first that ensures the system to asymptotically converge. Then, to simplify the communication complexity of the multi-agent consensus, a simple yet efficient algorithm is proposed termed the nearest neighbour principle (NNP). NNP leverages partial second-order and third-order neighbour information to largely reduce communication costs and thus contributing to the acceleration of convergence speed. Compared with classical third-order consensus algorithms, the simulation results show that NNP can not only urge the system to achieve consensus but also reduce its convergence time and communication cost.

Full Text
Paper version not known

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.