Group Flocking of Multiple Mobile Agents
In this paper,we consider group flocking of multi-agent systems in which agents are dispersed to different subgroups.By using local information,the flocking algorithms are proposed to solve group flocking problem in heterogeneous and homogeneous networks,respectively.For each given algorithm,the corresponding criterions are established to ensure both velocity alignment,cohesion of each subgroup,and collision avoidance between any two agents in the whole group.The proposed protocol can be modified to realize the division of agents into any pre-assigned number of subgroups,while solves the traditional flocking problem for each subgroup.Finally,simulation results are presented to verify the effectiveness of our theoretical results.
Flocking Multiple groups Heterogeneous networks Multi-agent systems
Gangshan Jing Yuanshi Zheng Long Wang
Center for Complex Systems,School of Mechano-electronic Engineering,Xidian University,Xian 710071,P Center for Systems and Control,College of Engineering,Peking University,Beijing 100871,P.R.China
国际会议
The 33th Chinese Control Conference第33届中国控制会议
南京
英文
1156-1161
2014-07-28(万方平台首次上网日期,不代表论文的发表时间)