Skip to main content
Log in

Gathering identical autonomous systems on a circle using stigmergy

Distributed Computing Aims and scope Submit manuscript

Abstract

In this paper we provide a protocol solving the problem of gathering of identical autonomous systems (aka ants) on a circle. In our biologically inspired model the autonomous systems are unable to communicate directly, instead they employ the mechanism of pheromone marking. The gathering on a circle is not always solvable, however our protocol will terminate in finite time if ants are in a general initial position. Since the gathering problem on a line is unsolvable for obvious reasons for any non-degenerate initial position, this implies that if the ants are in generic initial position they will be able to decide in finite time whether they are on a line or on a circle. We give asymptotic bounds for the time our protocol needs to terminate, and show that for fixed number of ants, the termination time of any protocol can be arbitrarily long. Finally, our protocol may be adopted to the case of asynchronous drop-downs and starting times of the autonomous systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Notes

  1. That notion will be defined in Sect. 5.

  2. In other words, the passive ant simply follows the group without changing the pheromone level.

  3. Meaning here that the algorithm will not terminate, i.e., the ants will not join in one group, for at least that long time.

References

  1. Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36(1), 56–82 (2006)

    Google Scholar 

  2. Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robotics Automat. 15(5), 818–828 (1999)

    Article  Google Scholar 

  3. Attiya, H., Rajsbaum, S.: The combinatorial structure of wait-free solvable tasks. SIAM J. Comput. 31(4), 1286–1313 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics (Wiley Series on Parallel and Distributed Computing). Wiley, Inc., Hoboken (2004)

  5. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence. Oxford University Press, Oxford (1999)

    MATH  Google Scholar 

  6. Cieliebak, M.: Gathering Non-oblivious Mobile Robots, LATIN 2004: Theoretical Informatics, Lecture Notes in Computer Science 2976, pp. 577–588. Springer, Berlin (2004)

  7. Dorigo, M., Stützle, Th: Ant Colony Optimization. MIT Press, Cambridge (2004)

    Book  MATH  Google Scholar 

  8. Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Multiple Mobile Agent Rendezvous in a Ring, LATIN 2004: Theoretical informatics, Lecture Notes in Computer Science 2976, pp. 599–608. Springer, Berlin (2004)

  9. Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1–3), 147–168 (2005)

    Google Scholar 

  10. Franklin, W.R.: On an improved algorithm for decentralized extrema finding in circular configurations of processors. Commun ACM 25, 336–337 (1982)

    Article  Google Scholar 

  11. Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858–923 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390(1), 27–39 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kozlov, D.N.: Combinatorial Algebraic Topology, Algorithms and Computation in Mathematics 21, p. 390. Springer, Berlin, XX, 115 illus (2008)

  14. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)

    MATH  Google Scholar 

  15. Turchin, P.: Quantitative Analysis of Movement: Measuring and Modeling Population Redistribution in Animals and Plants. Sinauer Associates, Sunderland (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dmitry N. Kozlov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kozlov, D.N. Gathering identical autonomous systems on a circle using stigmergy. Distrib. Comput. 25, 461–472 (2012). https://doi.org/10.1007/s00446-012-0178-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-012-0178-4

Keywords

Navigation