Multi-agent Deployment on a Ring Graph

  • Yotam Elor
  • Alfred M. Bruckstein
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6234)


We consider two variants of the task of spreading a swarm of agents uniformly on a ring graph. Ant-like oblivious agents having limited capabilities are considered. The agents are assumed to have little memory, they all execute the same algorithm and no direct communication is allowed between them. Furthermore, the agents do not possess any global information. In particular, the size of the ring (n) and the number of agents in the swarm (k) are unknown to them. The agents are assumed to operate on an unweighted ring graph. Every agent can measure the distance to his two neighbors on the ring, up to a limited range of V edges.

The first task considered, is uniformly spread dynamical (i.e. in motion) deployment on the ring. We show that if either the ring is unoriented, or the visibility range is less than \(\left\lfloor n/k\right\rfloor \), this is an impossible mission for the agents. Then, for an oriented ring and \(V\geq\left\lceil n/k\right\rceil \), we propose an algorithm which achieves the deployment task within the optimal time. The second task discussed, called quiescent spread, requires the agents to spread uniformly over the ring and stop moving. We prove that under our model in which every agent can measure the distance only to his two neighbors, this task is impossible. Subsequently, we propose an algorithm which achieves quiescent and almost uniform spread.

The algorithms we present are scalable and robust. In case the environment (the size of the ring) or the number of agents changes during the run, the swarm adapts and re-deploys without requiring any outside interference.


Mobile Robot Impossibility Result Circle Formation Unoriented Ring Uniform Spread 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Carli, R., Bullo, F.: Quantized coordination algorithms for rendezvous and deployment. Sicon (2009)Google Scholar
  2. 2.
    Chatzigiannakis, I., Markou, M., Nikoletseas, S.E.: Distributed circle formation for anonymous oblivious robots. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 159–174. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  3. 3.
    Cohen, R., Peleg, D.: Local spreading algorithms for autonomous robot systems. SIROCCO 2006 399(1-2), 71–82 (2008); Structural Information and Communication Complexity (SIROCCO 2006)Google Scholar
  4. 4.
    Defago, X., Souissi, S.: Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. Theoretical Computer Science 396(1-3), 97–112 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Dieudonne, Y., Labbani-Igbida, O., Petit, F.: Circle formation of weak mobile robots. ACM Trans. Auton. Adapt. Syst. 3(4), 1–20 (2008)CrossRefGoogle Scholar
  6. 6.
    Elor, Y., Bruckstein, A.M.: Multi-agent deployment and patrolling on a ring graph. Tech. rep., Computer Science Department. Technion Haifa, Israel (September 2009),
  7. 7.
    Flocchini, P., Prencipe, G., Santoro, N.: Self-deployment of mobile sensors on a ring. Theor. Comput. Sci. 402, 67–80 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    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
  9. 9.
    Hideki, Y., Oasa, A., Suzuki, I.: Formation and agreement problems for synchronous mobile robots with limited visibility. In: Proceedings of the 1995 IEEE International Symposium on Intelligent Control, pp. 453–460 (August 1995)Google Scholar
  10. 10.
    Katreniak, B.: Biangular Circle Formation by Asynchronous Mobile Robots. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, pp. 185–199. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Martinez, S., Bullo, F., Corts, J., Frazzoli, E.: On synchronous robotic networks-part ii: Time complexity of rendezvous and deployment algorithms. IEEE Transactions on Automatic Control 52(12), 2214–2226 (2007)CrossRefGoogle Scholar
  12. 12.
    Prencipe, G.: Instantaneous actions vs. full asynchronicity: Controlling and coordinating a set of autonomous mobile robots. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 154–171. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  13. 13.
    Sugihara, K., Suzuki, I.: Distributed algorithms for formation of geometric patterns with many mobile robots. Journal of Robotic Systems 13(3), 127–139 (1996)zbMATHCrossRefGoogle Scholar
  14. 14.
    Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal on Computing 28(4), 1347–1363 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Wagner, I.A., Bruckstein, A.M.: Row straightening via local interactions. Circuits, Systems, and Signal Processing 16(3), 287–305 (1997)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yotam Elor
    • 1
  • Alfred M. Bruckstein
    • 1
  1. 1.Faculty of Computer Science and the Goldstein UAV and Satellite CenterIsrael

Personalised recommendations