Fast flocking algorithm of multi-agent network via community division

被引:0
|
作者
Chen S.-M. [1 ]
Qiu Y. [1 ]
Liu J.-K. [1 ]
Nie S. [1 ]
机构
[1] School of Electrical and Automation Engineering, East China Jiaotong University, Nanchang
来源
Chen, Shi-Ming (c1977318@hotmail.com) | 2018年 / Northeast University卷 / 33期
关键词
Community division; Complex network; Convergence characteristics; Fast flocking control;
D O I
10.13195/j.kzyjc.2017.0478
中图分类号
学科分类号
摘要
Aiming at the effect of community characteristics of complex networks on collaborative control of multi-agent systems, a fast flocking control algorithm based on community division is proposed for the multi-agent system with the characteristic of the Erdos-renyi(ER) random network and Barabasi-albert(BA) scale-free network, which considers the relative concentration characteristics of agents in every community and incorporate attractive force of virtual leader between different communities, so the "block" phenomenon in evolution process because of communication constraint can be avoided and algebraic connectivity of the system is improved. Simulation results show that the convergence characteristics of the flocking behavior of the multi-agent system with complex networks are affected by the average degree of ER and BA networks and the power exponent of the degree of BA network distribution, and optimizing the number of partition communities is beneficial to improve the convergence speed. © 2018, Editorial Office of Control and Decision. All right reserved.
引用
收藏
页码:1523 / 1526
页数:3
相关论文
共 10 条
  • [1] Newman M.E.J., Bgirvan M., Finding and evaluating community structure in networks, Physical Review E, 69, 2, (2004)
  • [2] Shang R.H., Bai J., Jiao L.C., Community detection based on modularity and an improved genetic algorithm, Physica A: Statistical Mechanics and Its Applications, 392, 5, pp. 1215-1231, (2013)
  • [3] Atzmueller M., Doerfel S., Mitzlaff F., Description-ariented community detection using exhaustive subgroup discovery, Information Sciences, 329, C, pp. 965-984, (2016)
  • [4] Jia H.C., Ratnavelu K., Detecting community structure by using a constrained label propagation algorithm, Plos One, 11, 5, (2016)
  • [5] Zhou X., Yang F., Zhang F.M., Control method for complex network topological connection optimization, Acta Physica Sinica, 62, 15, (2013)
  • [6] Zhou H., Zhou W., Zeng W., Flocking control of multiple mobile agents with the rules of avoiding collision, Mathematical Problems in Engineering, 2015, 8, pp. 1-9, (2015)
  • [7] Chen S.M., Li H.M., Xie J., Pinning flocking control algorithm for power-driven multi-agent networks based on local estimation, Control and Decision, 28, 8, pp. 1190-1194, (2013)
  • [8] Chen S.M., Hua Y.X., Zhu Z.M., Fast flocking algorithm for multi-agent systems by optimizing local interactive topology, Acta Automatica Sinica, 41, 12, pp. 2092-2099, (2015)
  • [9] Olfati-Saber R., Flocking for multi-agent dynamic systems: Algorithms and theory, IEEE Trans on Automatic Control, 51, 3, pp. 401-420, (2006)
  • [10] Clauset A., Newman M.E.J., Moore C., Finding community structure in very large networks, Physical Review E, 70, 6, (2004)