Leader selection for optimal network coherence

We consider the problem of leader-based distributed coordination in networks where agents are subject to stochastic disturbances, but where certain designated leaders are immune to those disturbances. Specifically, we address the effect of leader selection on the coherence of the network, defined in...

Full description

Saved in:
Bibliographic Details
Published in49th IEEE Conference on Decision and Control (CDC) pp. 2692 - 2697
Main Authors Patterson, S, Bamieh, B
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2010
Subjects
Approximation algorithms
Coherence
Eigenvalues and eigenfunctions
Heuristic algorithms
Lead
Optimization
Robustness
Online AccessGet full text

Cover

More Information
Summary:We consider the problem of leader-based distributed coordination in networks where agents are subject to stochastic disturbances, but where certain designated leaders are immune to those disturbances. Specifically, we address the effect of leader selection on the coherence of the network, defined in terms of an H 2 norm of the system. This quantity captures the level of agreement of the nodes in the face of the external disturbances. We show that network coherence depends on the eigenvalues of a principal submatrix of the Laplacian matrix, and we formulate an optimization problem to select the set of leaders that results in the highest coherence. As this optimization problem is combinatorial in nature, we also present several greedy algorithms for leader selection that rely on more easily computable bounds of the H 2 norm and the eigenvalues of the system. Finally, we illustrate the effectiveness of these algorithms using several network examples.
ISBN:142447745X
9781424477456
ISSN:0191-2216
DOI:10.1109/CDC.2010.5718151