Algorithms for leader selection in large dynamical networks: Noise-free leaders

Makan Fardad, Fu Lin, Mihailo Jovanovic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

33 Scopus citations

Abstract

We consider networks of single-integrator systems, where it is desired to optimally assign a predetermined number of systems to act as leaders. Performance is measured in terms of the H2 norm of the overall network, and the leaders are assumed to always follow their desired state trajectories. We demonstrate that, after applying a sequence of relaxations, the problem can be formulated as a semidefinite program and thus solved efficiently. We compare the results of our algorithms against others reported in the literature. Finally, we interpret the leader selection problem in terms of electrical networks and Kron reduction theory.

Original languageEnglish (US)
Title of host publication2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages7188-7193
Number of pages6
ISBN (Print)9781612848006
DOIs
StatePublished - 2011
Event2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011 - Orlando, FL, United States
Duration: Dec 12 2011Dec 15 2011

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Other

Other2011 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011
Country/TerritoryUnited States
CityOrlando, FL
Period12/12/1112/15/11

Keywords

  • Consensus
  • Kron reduction
  • convex optimization
  • convex relaxation
  • effective resistance
  • leader selection
  • semidefinite programing
  • sparsity

Fingerprint

Dive into the research topics of 'Algorithms for leader selection in large dynamical networks: Noise-free leaders'. Together they form a unique fingerprint.

Cite this