A consensus algorithm of third-order multi-agent systems with time delay in undirected networks based on partial neighbour information

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.

Keywords:

• Third-order multi-agent systems
• time delay
• convergence condition
• nearest neighbour principle
• communication cost
• convergence speed

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Notes on contributors

Cheng Wang

Cheng Wang received the associate degree from the Department of Computer Science and Engineering, University of Science and Technology of China in 2000, and M.S. degree from Nanjing Agricultural University, China, in 2009. He now works in the Division of Information Construction and Management, Nanjing University of Science and Technology. His current research interests include multi-agent systems, information security, and data mining.