Local Interactions for Cohesive Flexible Swarms

Distributed gathering algorithms aim to achieve complete visibility graphs via a "never lose a neighbour" policy. We suggest a method to maintain connected graph topologies, while reducing the number of effective edges in the graph to order n. This allows to achieve different goals and swarming behaviours: the system remains connected but flexible, hence can maneuver in environments that are replete with obstacles and narrow passages, etc.

[1]  Kevin M. Passino,et al.  Stability analysis of swarms , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[2]  Alberto L. Sangiovanni-Vincentelli,et al.  Techniques for maintaining connectivity in wireless ad-hoc networks under energy constraints , 2007, TECS.

[3]  Xiao Fan Wang,et al.  Rendezvous of multiple mobile agents with preserved network connectivity , 2010, Syst. Control. Lett..

[4]  Dimos V. Dimarogonas,et al.  On the Rendezvous Problem for Multiple Nonholonomic Agents , 2007, IEEE Transactions on Automatic Control.

[5]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[6]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[7]  K.M. Passino,et al.  Stability analysis of social foraging swarms , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[8]  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).

[9]  Israel A. Wagner,et al.  Gathering Multiple Robotic A(ge)nts with Limited Sensing Capabilities , 2004, ANTS Workshop.

[10]  A. Jadbabaie,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[11]  F. Bullo,et al.  On collective motion in sensor networks: sample problems and distributed algorithms , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[12]  Israel A. Wagner,et al.  A Randomized Gathering Algorithm for Multiple Robots with Limited Sensing Capabilities , 2018 .

[13]  Masafumi Yamashita,et al.  Distributed memoryless point convergence algorithm for mobile robots with limited visibility , 1999, IEEE Trans. Robotics Autom..

[14]  Friedhelm Meyer auf der Heide,et al.  A Continuous Strategy for Collisionless Gathering , 2017, ALGOSENSORS.

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

[16]  Roderich Groß,et al.  Finding Consensus Without Computation , 2018, IEEE Robotics and Automation Letters.

[17]  Alfred M. Bruckstein,et al.  Probabilistic Gathering Of Agents With Simple Sensors , 2019, SIAM J. Appl. Math..

[18]  A. Bruckstein,et al.  Chase Your Farthest Neighbour : A simple gathering algorithm for anonymous , oblivious and non-communicating agents , 2016 .

[19]  Alfred M. Bruckstein,et al.  COME TOGETHER: Multi-Agent Geometric Consensus (Gathering, Rendezvous, Clustering, Aggregation) , 2019, ArXiv.

[20]  Alfred M. Bruckstein,et al.  Chase Your Farthest Neighbour , 2016, DARS.

[21]  F. Bullo,et al.  Motion Coordination with Distributed Information , 2007 .