Journal of System Simulation ›› 2023, Vol. 35 ›› Issue (3): 616-622.doi: 10.16182/j.issn1004731x.joss.21-1158

• Papers • Previous Articles     Next Articles

Multiagent Following Multileader Algorithm Based on K-means Clustering

Guodong Yuan(), Ming He(), Ziyu Ma, Weishi Zhang, Xueda Liu, Wei Li   

  1. Command And Control Engineering College, Army Engineering University of PLA, Nanjing 210001, China
  • Received:2021-11-11 Revised:2022-01-21 Online:2023-03-30 Published:2023-03-22
  • Contact: Ming He E-mail:305551544@qq.com;paper_review@126.com

Abstract:

Three K-means clustering algorithms are proposed to prevent chaos in the formation of a multi-agent system (MAS) with multiple leaders. The algorithm divides the cluster into communities with the same number of leaders, and the agents within the community will follow the same leader. Among the three proposed algorithms, algorithm #1 is suitable for scenarios with widely distributed agents wherein rapid consensus can be achieved in the shortest time; algorithm #2 is suitable for scenarios with a sparse agent distribution and effectively prevented agent collisions; and algorithm #3 exhibits rapid convergence and considerably reduces the MAS control cost, but will sacrifice the convergence speed of the system.. Unlike the traditional method in which the agents are numbered and the leader-follower relationship is fixed, the proposed clustering methods can shorten the MAS convergence time and effectively adapt to task changes by rapidly assigning new suitable tasks to agents.

Key words: multi-agent, multiple leaders, K-means, pinning control, clustering methods

CLC Number: