Consensus in Networks of Multiagents with Switching Topologies Modeled as Adapted Stochastic Processes

Liu, Bo; Lu, Wenlian; Chen, Tianping

doi:10.1137/090745945

Cited by 62 publications

(48 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The basic method is to use a distributed consensus protocol. Specifically, each agent updates its state based on its own and the states of its neighbors in such a way that the final states of all agents converge to a common value, e.g., [1][2][3][4]. However, real systems are subject to physical constraints such as input, output, digital communication channels, and sensors constraints.…”

Section: Introductionmentioning

confidence: 99%

Event-triggered control for multi-agent systems with output saturation

Yang

et al. 2017

2017 36th Chinese Control Conference (CCC)

View full text Add to dashboard Cite

We propose distributed static and dynamic event-triggered control laws to solve the consensus problem for multiagent systems with output saturation. Under the condition that the underlying graph is undirected and connected, we show that consensus is achieved under both event-triggered control laws if and only if the average of the initial states is within the saturation level. Numerical simulations are provided to illustrate the effectiveness of the theoretical results and to show that the control laws lead to reduced need for inter-agent communications.

show abstract

Section: Introductionmentioning

confidence: 99%

Event-triggered control for multi-agent systems with output saturation

Yang

et al. 2017

2017 36th Chinese Control Conference (CCC)

View full text Add to dashboard Cite

show abstract

“…In the most existing literature, the concept of spanning tree is widely use to describe the communicability between agents in networks that can guarantee the consensus of (1). See [16], [17], [18].…”

Section: Introductionmentioning

confidence: 99%

“…So, in most of the papers involving stability analysis of (2), the sufficient conditions were expressed in terms of spanning trees in the union graph across time intervals of a given length. See [11], [18] and the references therein. Besides, communication delays were also widely investigated [17], [23], [24] and nonlinear consensus algorithms were proposed [25].…”

Section: Introductionmentioning

confidence: 99%

“…Up till now, most papers in the literature mainly concern the global consensus. For instance, in [15], [18], the (global) conseus was studied, especially for multiagent system with time-varying topologies. There are essential differences between global consensus and the cluster consensus conidered the current paper, which means synchronization among the same cluster but the agents in different cluster have different state trajectories.…”

Section: Introductionmentioning

confidence: 99%

“…Different from the Lyapunov approach used in [35], in the current paper, we used the algebraic theory of product of infinite matrices and graph theory to derive the main results. The enhancements in this paper, in comparison with the literature involved with (global) consensus like [15], [18] as well as the literature involved with cluster synchronization, like [35], are as follows. (1).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cluster Consensus in Discrete-Time Networks of Multiagents With Inter-Cluster Nonidentical Inputs

Han¹,

Lu²,

Chen³

2013

IEEE Trans. Neural Netw. Learning Syst.

115

View full text Add to dashboard Cite

Abstract-In this paper, cluster consensus of multi-agent systems is studied via inter-cluster nonidentical inputs. Here, we consider general graph topologies, which might be time-varying. The cluster consensus is defined by two aspects: the intracluster synchronization, that the state differences between each pair of agents in the same cluster converge to zero, and intercluster separation, that the states of the agents in different clusters are separated. For intra-cluster synchronization, the concepts and theories of consensus including the spanning trees, scramblingness, infinite stochastic matrix product and Hajnal inequality, are extended. With them, it is proved that if the graph has cluster spanning trees and all vertices self-linked, then static linear system can realize intra-cluster synchronization. For the time-varying coupling cases, it is proved that if there exists T > 0 such that the union graph across any T -length time interval has cluster spanning trees and all graphs has all vertices self-linked, then the time-varying linear system can also realize intra-cluster synchronization. Under the assumption of common inter-cluster influence, a sort of inter-cluster nonidentical inputs are utilized to realize inter-cluster separation, that each agent in the same cluster receives the same inputs and agents in different clusters have different inputs. In addition, the boundedness of the infinite sum of the inputs can guarantee the boundedness of the trajectory. As an application, we employ a modified nonBayesian social learning model to illustrate the effectiveness of our results.

show abstract

Averaging in Time-Varying Networks

Fagnani

Frasca

2017

Introduction to Averaging Dynamics Over Networks

View full text Add to dashboard Cite

Consensus in Networks of Multiagents with Switching Topologies Modeled as Adapted Stochastic Processes

Cited by 62 publications

References 31 publications

Event-triggered control for multi-agent systems with output saturation

Event-triggered control for multi-agent systems with output saturation

Cluster Consensus in Discrete-Time Networks of Multiagents With Inter-Cluster Nonidentical Inputs

Averaging in Time-Varying Networks

Contact Info

Product

Resources

About