Advertisement

Swarm Intelligence

, Volume 11, Issue 3–4, pp 271–293 | Cite as

Continuous time gathering of agents with limited visibility and bearing-only sensing

Article
  • 424 Downloads

Abstract

A group of mobile agents, identical, anonymous, and oblivious (memoryless), able to sense only the 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 act in continuous time, and their rule of motion is as follows: they determine the smallest visibility disk sector in which all their visible neighbors reside. If this disk sector spans an angle smaller than \(\pi \), then they set the velocity vector to be the sum of the two unit vectors in \({\mathbb {R}}^2\) pointing to the extremal neighbors. Otherwise, they do not move. If the initial constellation of agents has a visibility graph that is connected, we prove that the agents gather to a common meeting point in finite time.

Keywords

Finite time gathering Bearing-only sensing Agents with finite visibility sensing 

References

  1. Ando, H., Oasa, Y., Suzuki, I., & Yamashita, M. (1999). Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transactions on Robotics and Automation, 15(5), 818–828.CrossRefGoogle Scholar
  2. Barel, A., Manor, R., & Bruckstein., A. M. (2016). Come together: Multi-agent geometric consensus. In Technion center of intelligent systems report. Available at www.cs.technion.ac.il, CIS-2016-03.
  3. Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2015). Linear and competitive strategies for continuous robot formation problems. ACM Transactions on Parallel Computing, 2(1), 2.1–2.18.Google Scholar
  4. Gazi, V., & Passino, K. M. (2006). Stability analysis of swarms. IEEE Transactions on Automatic Control, 51(6), 692–697.MathSciNetMATHGoogle Scholar
  5. Gordon, N., Elor, Y., & Bruckstein, A. M. (2008). Gathering multiple robotic agents with crude distance sensing capabilities. In Ant Colony Optimization and Swarm Intelligence, LNCS (Vol. 5217, pp. 72–83). Springer.Google Scholar
  6. Gordon, N., Wagner, I. A., & Bruckstein, A. M. (2004). Gathering multiple robotic a(ge)nts with limited sensing capabilities. In Ant Colony Optimization and Swarm Intelligence, LNCS (Vol. 3172, pp. 142–153). Springer.Google Scholar
  7. Gordon, N., Wagner, I. A., & Bruckstein, A. M. (2005). A randomized gathering algorithm for multipe robots with limited sensing capabilities. In P. Sapaty & J. Filipe (Eds.), Proceedings of INSTICC Press (pp. 56–63).Google Scholar
  8. Ji, M., & Egerstedt, M. (2007). Distributed coordination control of multiagent systems while preserving connectedness. IEEE Transactions on Robotics, 23(4), 693–703.CrossRefGoogle Scholar
  9. Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2012). Optimal and competitve runtime bounds for continuous, local gathering of mobile robots. In Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’11) (pp. 18–26). NY: ACM.Google Scholar
  10. Olfati-Saber, R., Fax, A., & Murray, R. M. (2007). Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE, 95(1), 215–233.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Technion, Israel Institute of TechnologyHaifaIsrael

Personalised recommendations