• DocumentCode
    2250860
  • Title

    On the number of leaders needed to ensure network connectivity

  • Author

    Dimarogonas, Dimos V. ; Gustavi, Tove ; Egerstedt, Magnus ; Hu, Xiaoming

  • Author_Institution
    KTH ACCESS Linnaeus Center, R. Inst. of Technol. (KTH), Stockholm, Sweden
  • fYear
    2008
  • fDate
    9-11 Dec. 2008
  • Firstpage
    1797
  • Lastpage
    1802
  • Abstract
    In this paper we examine the leader-to-follower ratio needed to maintain connectivity in a leader-follower multi-agent network with proximity based communication topology. In the scenario we consider, only the leaders are aware of the global mission, which is to converge to a known destination point. Thus, the objective of the leaders is to drag the team to the desired goal. In the paper we obtain bounds on the number of leaders needed to complete the task while guaranteeing that connectedness of the communication graph is maintained. The results are first established for an initially complete communication graph and then extended to the incomplete case. The results are illustrated by computer simulations.
  • Keywords
    computer network management; computer network reliability; multi-agent systems; communication graph; leader-follower multiagent network; leader-to-follower ratio; network connectivity; proximity based communication topology; Application software; Communication system control; Computer simulation; Control systems; Costs; Encoding; Network topology; Robot sensing systems; Sensor systems and applications; Systems engineering and theory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 2008. CDC 2008. 47th IEEE Conference on
  • Conference_Location
    Cancun
  • ISSN
    0191-2216
  • Print_ISBN
    978-1-4244-3123-6
  • Electronic_ISBN
    0191-2216
  • Type

    conf

  • DOI
    10.1109/CDC.2008.4739212
  • Filename
    4739212