Consensus control for networks of dynamic agents via active switching topology

Authors:
Guangming Xie;Long Wang
Affiliations:
Center for Systems & Control, LTCS and Department of Mechanics and Engineering Science, Peking University, Beijing, China;Center for Systems & Control, LTCS and Department of Mechanics and Engineering Science, Peking University, Beijing, China
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Year:
2005

Citing 4
Cited 1

Flocks, herds and schools: A distributed behavioral model

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Distributed Algorithms

Distributed Algorithms
Aggregation of foraging swarms

AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Stability analysis of social foraging swarms

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Load balancing over heterogeneous networks with gossip-based algorithms

ACC'09 Proceedings of the 2009 conference on American Control Conference

Quantified Score

Hi-index	0.00

Visualization

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 that are consistent with our theoretical results.