Leader-following consensus of multi-agent systems with jointly connected topology using distributed adaptive protocols

Mu, Xiaomin; Xiao, Xia; Liu, Kai; Zhang, Jian

doi:10.1016/j.jfranklin.2014.09.018

Cited by 53 publications

(25 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the limited bandwidth communication and other factors, some of them are disconnected, even all of them. But

\cup_{σ (t) = 1}^{M} G^{[σ (t)]}

is connected, which is called as a jointly connected switching topology such as References . When G [σ( t )] is not connected but jointly connected, similar problems could be considered.…”

Section: Resultsmentioning

confidence: 99%

“…When the topology is jointly connected, some improved results and methods were proposed. For example, less relaxed conditions about consensus problems for multiagent systems with a linear and Lipschitz nonlinear dynamics were presented in Reference , and the classical assumption of switching among connected graphs was dropped in Reference . Among these methods, it is seen that most of them are concerned about fixed topologies.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Consensus of multiagent systems with random switching topologies and its application

Wang

Sun

2019

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

Summary This paper is concerned on the consensus problem of multiagent systems with random switching topologies, where the dwell time of each topology consists of fixed and random parts. Firstly, the consensus analysis of such multiagent systems is considered by a mode‐dependent Lyapunov function approach, whose conditions are developed in terms of linear matrix inequalities. Then, three kinds of consensus protocols based on random switching topologies are proposed, whose differences are also illustrated. Moreover, all the existence conditions of such consensus controllers are presented with solvable forms, where the dwell times and topology are both included and play important roles. Finally, the proposed consensus protocols are applied to a chemical process to demonstrate the effectiveness of the proposed methods.

show abstract

“…Due to the limited bandwidth communication and other factors, some of them are disconnected, even all of them. But

\cup_{σ (t) = 1}^{M} G^{[σ (t)]}

is connected, which is called as a jointly connected switching topology such as References . When G [σ( t )] is not connected but jointly connected, similar problems could be considered.…”

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Consensus of multiagent systems with random switching topologies and its application

Wang

Sun

2019

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

show abstract

“…Moreover, it is obvious that the jointly connected switching network is more realistic due to the link failure or sensor limitations. However, most existing achievements address the consensus problem with jointly connected directed networks for simple linear multiagent systems only or with jointly connected undirected networks for Lispchitz‐type nonlinear systems . Hence, constructing a distributed protocol to realize consensus disturbance rejection for the nonlinear multiagent system with jointly connected directed networks remains challenging.…”

Section: Resultsmentioning

confidence: 99%

Disturbance observer–based consensus tracking for nonlinear multiagent systems with switching topologies

Jia

et al. 2017

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

Summary This paper considers the leader‐follower consensus tracking problem for nonlinear multiagent systems with external disturbances and switching topologies. A distributed disturbance observer is constructed to estimate the disturbances suffered by the followers. Then, a distributed consensus protocol is proposed for the consensus tracking problem with disturbance rejection under a fixed directed topology based on the disturbance observer. Next, this result is extended to the case in which the switching communication topology only frequently but not always contains a directed spanning tree. By selecting the parameters appropriately such that the communication time satisfies various preset conditions, it is theoretically proven that the consensus tracking with disturbance rejection can also be achieved by the multiagent systems. Finally, a simulation example is presented to demonstrate the performance of the proposed control scheme.

show abstract

“…According to (20), one can obtain that _ V t ð Þo 0. This means that the consensus problem is solved.…”

Section: Lemma 6 (Hespanha and Morse[28]) (Sylvester Law Of Inertiamentioning

confidence: 99%

“…As for high-order dynamics which can include the first-order dynamics as a special case, the existing conclusions are mainly focused on the leader-following case [19][20][21]. Considering the fact that, for the homogeneous agents, the leaderless consensus problem can include the leader-following consensus problem as special cases, the leaderless case is more challenging than the leader-following case.…”

mentioning

confidence: 99%

Leaderless consensus of multi-agent systems with Lipschitz nonlinear dynamics and switching topologies

Liu

Zhou

et al. 2016

Neurocomputing

View full text Add to dashboard Cite

Leader-following consensus of multi-agent systems with jointly connected topology using distributed adaptive protocols

Cited by 53 publications

References 24 publications

Consensus of multiagent systems with random switching topologies and its application

Consensus of multiagent systems with random switching topologies and its application

Disturbance observer–based consensus tracking for nonlinear multiagent systems with switching topologies

Leaderless consensus of multi-agent systems with Lipschitz nonlinear dynamics and switching topologies

Contact Info

Product

Resources

About