Containment in leader-follower networks with switching communication topologies

We study bipartite, first-order networks where the nodes take on leader or follower roles. Specifically, we let the leaders' positions be static and assume that leaders and followers communicate via an undirected switching graph topology. This assumption is inspired by the swarming behavior of silkworm moths, where female moths intermittently release pheromones to be detected by the males. The main result presented here states that if the followers execute the linear agreement protocol, they will converge to the convex hull spanned by the leaders' positions as long as the time-varying undirected graph defining the communication among all agents is jointly connected. The novelty of this research is that we use LaSalle's Invariance Principle for switched systems, and additionally, the result is shown to hold for arbitrary state dimensions.

[1]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[2]  Magnus Egerstedt,et al.  Laplacian Sheep: A Hybrid, Stop-Go Policy for Leader-Based Containment Control , 2006, HSCC.

[3]  I D Couzin,et al.  Self-organized lane formation and optimized traffic flow in army ants , 2003, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[4]  K. Passino,et al.  A class of attraction/repulsion functions for stable swarm aggregations , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[5]  L. Moreau,et al.  Stability of continuous-time distributed consensus algorithms , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[6]  Max Donath,et al.  American Control Conference , 1993 .

[7]  J. Deneubourg,et al.  From individual to collective behavior in social insects , 1987 .

[8]  M. Egerstedt,et al.  Leader-based multi-agent coordination: controllability and optimal control , 2006, 2006 American Control Conference.

[9]  Magnus Egerstedt,et al.  Solving Coverage Problems with Embedded Graph Grammars , 2007, HSCC.

[10]  Randy Thornhill,et al.  The Evolution of Insect Mating Systems , 1983 .

[11]  M. Wade,et al.  THE EVOLUTION OF INSECT MATING SYSTEMS. , 1984, Evolution; international journal of organic evolution.

[12]  M. Egerstedt,et al.  First-order, networked control models of swarming silkworm moths , 2008, 2008 American Control Conference.

[13]  H. E. Hummel,et al.  Techniques in Pheromone Research , 1984, Springer Series in Experimental Entomology.

[14]  R. Beard,et al.  Consensus of information under dynamically changing interaction topologies , 2004, Proceedings of the 2004 American Control Conference.

[15]  José Luis Mancilla-Aguilar,et al.  An extension of LaSalle's invariance principle for switched systems , 2005, Syst. Control. Lett..

[16]  W. M. Wheeler,et al.  Social Life Among the Insects , 1922 .

[17]  Julia K. Parrish,et al.  Extracting Interactive Control Algorithms from Group Dynamics of Schooling Fish , 2005 .

[18]  Yongcan Cao,et al.  Containment control with multiple stationary or dynamic leaders under a directed interaction graph , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[19]  Sonia Martínez,et al.  Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions , 2006, IEEE Transactions on Automatic Control.

[20]  K. Passino,et al.  A class of attractions/repulsion functions for stable swarm aggregations , 2004 .

[21]  Magnus Egerstedt,et al.  Hybrid Systems: Computation and Control, 11th International Workshop, HSCC 2008, St. Louis, MO, USA, April 22-24, 2008. Proceedings , 2008, HSCC.

[22]  Magnus Egerstedt,et al.  Rendezvous with multiple, intermittent leaders , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[23]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..