Continuous Time Gathering of Agents with Limited Visibility and Bearing-only Sensing

  • Levi Itzhak BellaicheEmail author
  • Alfred BrucksteinEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9882)


A group of mobile agents, identical, anonymous, and oblivious (memoryless), having the capacity to sense only the relative direction (bearing) to neighboring agents within a finite visibility range, are shown to gather to a meeting point in finite time by applying a very simple rule of motion. The agents’ rule of motion is: set your velocity vector to be the sum of the two unit vectors in \(\mathbb {R}^2\) pointing to your “extremal” neighbours determining the smallest visibility disc sector in which all your visible neighbors reside, provided it spans an angle smaller than \(\pi \), otherwise, since you are “surrounded” by visible neighbors, simply stay put. Of course, the initial constellation of agents must have a visibility graph that is connected, and provided this we prove that the agents gather to a common meeting point in finite time, while the distances between agents that initially see each other monotonically decreases.


Gathering Bearing-only Convex polygon 


  1. 1.
    Bellaiche, L.-I., Bruckstein, A.: Continuous time gathering of agents with limited visibility and bearing-only sensing (2015). arXiv:1510.09115
  2. 2.
    Ji, M., Egerstedt, M.: Distributed coordination control of multiagent systems while preserving connectedness. IEEE Trans. Robot. 23(4), 693–703 (2007)CrossRefGoogle Scholar
  3. 3.
    Gordon, N., Wagner, I.A., Bruckstein, A.M.: Gathering multiple robotic a(ge)nts with limited sensing capabilities. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 142–153. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Gordon, N., Wagner, I.A., Bruckstein, A.M.: A randomized gathering algorithm for multipe robots with limited sensing capabilities. In: MARS 2005 Workshop Proceedings (ICINCO 2005), Barcelona, Spain (2005)Google Scholar
  5. 5.
    Gordon, N., Elor, Y., Bruckstein, A.M.: Gathering multiple robotic agents with crude distance sensing capabilities. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 72–83. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Olfati-Saber, R., Fax, V., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proc. IEEE 95(1), 215–233 (2007)CrossRefGoogle Scholar
  7. 7.
    Gazi, V., Passino, K.M.: Stability analysis of swarms. IEEE Trans. Autom. Control 48(4), 692–697 (2003)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robot. Autom. 15(5), 818–828 (1999)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Technion, Israel Institute of TechnologyHaifaIsrael

Personalised recommendations