Analysis of Asynchronous Containment Control Problem for Discrete-Time Multi-Agent Systems
Asynchronous containment control problem of discretetime multi-agent system is investigated in this paper.It is assumed that each agent can detect the state information of neighbors to update its state by its own clock,which is independent of the other agents.Based on nonnegative matrix theory and graph theory,we derive a necessary and sufficient condition to guarantee that all the follower agents asymptotically converge to the static convex leader set.Finally,some simulation examples are performed to validate the obtained theoretical results.
Asynchronous system Multi-agent system Multiple leaders Containment Control
Jinliang Shao Lei Shi Lisha Gong
School of Mathematical Science,University of electronic science and technology,Chengdu 611731,China
国际会议
重庆
英文
247-251
2017-03-25(万方平台首次上网日期,不代表论文的发表时间)