2005
DOI: 10.1007/11539902_51
|View full text |Cite
|
Sign up to set email alerts
|

Consensus Control for Networks of Dynamic Agents via Active Switching Topology

Abstract: Abstract. This paper investigates the average-consensus problem for networks of dynamic agents. A consensus protocol based on active switching topology for solving the average-consensus problem of the network is proposed. Within such a topology, a finite set of candidate unconnected graphs is used and we change the topology actively according to the state of the network. The advantage of such mechanism is that it decreases the communication complexity/cost dramatically. The simulation results are presented tha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2006
2006
2021
2021

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 18 publications
(8 citation statements)
references
References 30 publications
0
8
0
Order By: Relevance
“…where the second equality is from (12); the first inequality is from (17), and σ(t) = σ(t k ) for t ∈ [t k , t k+1 ); the second inequality is from µ = min i∈{1,...,m} µ i . Application of the comparison lemma (Lemma 3.4 in [25]) yields…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…where the second equality is from (12); the first inequality is from (17), and σ(t) = σ(t k ) for t ∈ [t k , t k+1 ); the second inequality is from µ = min i∈{1,...,m} µ i . Application of the comparison lemma (Lemma 3.4 in [25]) yields…”
Section: Resultsmentioning
confidence: 99%
“…Recent studies show that strategic switching of the network topology plays an important role in solving control problems of networked multi-agent systems. For example, [17] presents a centralized topology switching algorithm to achieve consensus for the first-order multi-agent systems. Active topology switching algorithms proposed in [18], [19] achieve consensus for the second-order multi-agent systems.…”
Section: Introductionmentioning
confidence: 99%
“…The study of consensus networks has recently stirred much interest in the control community with a particular focus on the deep connection between consensus and algebraic graph theory [9], [14], [15], [17], [20], [23], [24], [25], [26].…”
Section: Introductionmentioning
confidence: 99%
“…Multiple mobile autonomous agents coupled with each other through interactions can generate certain ordered behaviors, such as aggregation, cohesion, alignment, and rotation. So far, several models have been presented to investigate these self-organized behavior [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25] . Some of the models make use of the assumption that the interaction among the individual agents has a long-range attractive and short-range repulsive nature.…”
Section: Introductionmentioning
confidence: 99%