Sparsest Minimum Multiple-Cost Structural Leader Selection
Sergio Pequito, George Pappas, Vijay Kumar, James Svacha

Citation
Sergio Pequito, George Pappas, Vijay Kumar, James Svacha. "Sparsest Minimum Multiple-Cost Structural Leader Selection". 5th IFAC Workshop on Distributed Estimation and Control in Networked Systems, 6, 10, September, 2015.

Abstract
In this paper, we address the problem of leader selection in a network of agents when input signal can originate in different sources, for instance, communication/control towers, and incur in different costs. We assume that each agent's state is defined by a scalar that evolves according to a linear dynamics involving the states of its neighbors and its own state.We propose an algorithm to determine the minimum number those agents that should behave as leaders (i.e., agents whose state serves as a reference (or input) to the remaining agents -- the followers), while incurring in the lowest cost. Finally, illustrative examples using the main results of the paper are provided.

Electronic downloads

Internal. This publication has been marked by the author for TerraSwarm-only distribution, so electronic downloads are not available without logging in.

Citation formats

• HTML

  Sergio Pequito, George Pappas, Vijay Kumar, James Svacha.
  <a
  href="http://www.terraswarm.org/pubs/586.html"
  >Sparsest Minimum Multiple-Cost Structural Leader
  Selection</a>, 5th IFAC Workshop on Distributed
  Estimation and Control in Networked Systems, 6, 10,
  September, 2015.

• Plain text

  Sergio Pequito, George Pappas, Vijay Kumar, James Svacha.
  "Sparsest Minimum Multiple-Cost Structural Leader
  Selection". 5th IFAC Workshop on Distributed Estimation
  and Control in Networked Systems, 6, 10, September, 2015.

• BibTeX

  @inproceedings{PequitoPappasKumarSvacha15_SparsestMinimumMultipleCostStructuralLeaderSelection,
      author = {Sergio Pequito and George Pappas and Vijay Kumar
                and James Svacha},
      title = {Sparsest Minimum Multiple-Cost Structural Leader
                Selection},
      booktitle = {5th IFAC Workshop on Distributed Estimation and
                Control in Networked Systems},
      pages = {6},
      day = {10},
      month = {September},
      year = {2015},
      abstract = {In this paper, we address the problem of leader
                selection in a network of agents when input signal
                can originate in different sources, for instance,
                communication/control towers, and incur in
                different costs. We assume that each agent's state
                is defined by a scalar that evolves according to a
                linear dynamics involving the states of its
                neighbors and its own state.We propose an
                algorithm to determine the minimum number those
                agents that should behave as leaders (i.e., agents
                whose state serves as a reference (or input) to
                the remaining agents -- the followers), while
                incurring in the lowest cost. Finally,
                illustrative examples using the main results of
                the paper are provided.},
      URL = {http://terraswarm.org/pubs/586.html}
  }
  

Posted by Sergio Pequito on 6 Jun 2015.
Groups: services