Multi-agent consensus with diverse time-delays and jointly-connected topologies

Lin, Peng; Jia, Yingmin

doi:10.1016/j.automatica.2011.01.053

Cited by 135 publications

(87 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By the proof of Theorem 1, there must exist K and T satisfying (9) if and only if (A, B) is stabilisable and G has a spanning tree. The difficulty of Theorem 9 is the calculation of e AT and T 0 e Az dz, which can be solved by some softwares, such as Matlab.…”

Section: Protocol Designmentioning

confidence: 98%

Consensusability of continuous‐time multi‐agent systems with general linear dynamics and intermittent measurements

Gao

Zuo

et al. 2013

IET Control Theory & Applications

View full text Add to dashboard Cite

This article studies the consensusability of multi-agent systems with general linear continuous-time dynamics. It is assumed that each agent can only obtain the information of other agents at sampling instants. Some sufficient and necessary conditions for consensusability in the case of state feedback are established, and it is shown that multi-agent systems with periodic sampling are consensusable if and only if the system associated with each agent is stabilisable and the topology graph has a spanning tree. Furthermore, some methods are provided to seek controller gain and sampling period which ensure consensus. Simulations are performed to validate the theoretical results.

show abstract

Section: Protocol Designmentioning

confidence: 98%

Consensusability of continuous‐time multi‐agent systems with general linear dynamics and intermittent measurements

Gao

Zuo

et al. 2013

IET Control Theory & Applications

View full text Add to dashboard Cite

show abstract

“…In [28][29][30], the switching communication topologies were assumed to be governed by continuous-time homogeneous Markov processes, whose state space corresponds to the communication patterns. The authors of [31][32][33] considered continuous-time multi-agent systems under jointly connected topologies, which had less constraints on each possible topology. However, these results are quite conservative in the sense that the underlying topology of the system switches without concerning the current states of the multi-agent systems.…”

Section: Introductionmentioning

confidence: 99%

Distributed Consensus of Nonlinear Multi-Agent Systems on State-Controlled Switching Topologies

Chen

Wang

Zhang

2016

Entropy

View full text Add to dashboard Cite

This paper considers the consensus problem of nonlinear multi-agent systems under switching directed topologies. Specifically, the dynamics of each agent incorporates an intrinsic nonlinear term and the interaction topology may not contain a spanning tree at any time. By designing a state-controlled switching law, we show that the multi-agent system with the neighbor-based protocol can achieve consensus if the switching topologies jointly contain a spanning tree. Moreover, an easily manageable algebraic criterion is deduced to unravel the underlying mechanisms in reaching consensus. Finally, a numerical example is exploited to illustrate the effectiveness of the developed theoretical results.

show abstract

“…In the early pioneering works ( ( ), ( )), Vicsek et al proposed a simple model of autonomous agents, and Olfati et al established a framework of consensus control for the first-order integrators with different topologies. Since then, many results have been done under different conditions such as finite-time consensus ( ( ), ( ), ( )), quantized Kashyap et al 2007Carli & Bullo 2009Zhu & Martinez 2011Wang & Slotine 2006Lin & Jia 2011Wen et al 2013bYu et al 2013Hu 2011Chen et al 2014Wen et al 2012Yu et al 2010Li et al 2010Li et al 2013Wang et al 2013Diao et al 2014Mei et al 2011Zhao et al 2014Hong et al 2008 Peng & Yang 2009 Hu 2011 …”

Section: Introductionmentioning

confidence: 99%

Adaptive output feedback consensus tracking for linear multi-agent systems with unknown dynamics

Sun

2015

International Journal of Control

View full text Add to dashboard Cite

In this paper, the consensus tracking problem with unknown dynamics in the leader for the linear multiagent systems is addressed. Based on the relative output information among the agents, decentralized adaptive consensus protocols with static coupling gains are designed to guarantee that the consensus tracking errors converge to a small neighborhood around the origin and all the signals in the closed-loop dynamics are uniformly ultimately bounded. Moreover, the result is extended to the case with dynamic coupling gains which are independent of the eigenvalues of the Laplacian matrix. Both of the protocols with static and dynamic coupling gains are designed by using the relative outputs, which are more practical than the state-feedback ones. Finally, the theoretical results are verified through an example.

show abstract

Multi-agent consensus with diverse time-delays and jointly-connected topologies

Cited by 135 publications

References 18 publications

Consensusability of continuous‐time multi‐agent systems with general linear dynamics and intermittent measurements

Consensusability of continuous‐time multi‐agent systems with general linear dynamics and intermittent measurements

Distributed Consensus of Nonlinear Multi-Agent Systems on State-Controlled Switching Topologies

Adaptive output feedback consensus tracking for linear multi-agent systems with unknown dynamics

Contact Info

Product

Resources

About