Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Distributed computing by mobile robots: uniform circle formation

Abstract

Consider a set of n finite set of simple autonomous mobile robots (asynchronous, no common coordinate system, no identities, no central coordination, no direct communication, no memory of the past, non-rigid, deterministic) initially in distinct locations, moving freely in the plane and able to sense the positions of the other robots. We study the primitive task of the robots arranging themselves on the vertices of a regular n-gon not fixed in advance (Uniform Circle Formation). In the literature, the existing algorithmic contributions are limited to conveniently restricted sets of initial configurations of the robots and to more powerful robots. The question of whether such simple robots could deterministically form a uniform circle has remained open. In this paper, we constructively prove that indeed the Uniform Circle Formation problem is solvable for any initial configuration in which the robots are in distinct locations, without any additional assumption (if two robots are in the same location, the problem is easily seen to be unsolvable). In addition to closing a long-standing problem, the result of this paper also implies that, for pattern formation, asynchrony is not a computational handicap, and that additional powers such as chirality and rigidity are computationally irrelevant.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Notes

  1. 1.

    The value of \(\delta \) is assumed to be the same for all robots. However, since the robots are finitely many, nothing changes if each robot has a different \(\delta \): all the executions in this model are compatible with a “global” \(\delta \) that is the minimum of all the “local” \(\delta \)’s.

  2. 2.

    Roughly the same mechanism has been used in [3], with some technical differences.

  3. 3.

    The results in [19] seem to imply that the Uniform Circle Formation problem can be solved for any odd number of robots in \(\mathcal{ASYNC}\). A proof for the \(\mathcal{SSYNC}\) model is given, but its generalization to \(\mathcal{ASYNC}\) is missing some crucial parts. No extended version of the paper has been published, either. Hence, for completeness, we provide our own solutions for the special cases \(n=3\) and \(n=5\).

  4. 4.

    The proof of Lemma 21 also provides a way of constructing such intervals with a compass and a straightedge, and hence by algebraic functions.

References

  1. 1.

    Bramas, Q., Tixeuil, S.: Wait-free gathering without chirality. In: 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO), 313–327 (2015)

  2. 2.

    Chatzigiannakis, I., Markou, M., Nikoletseas, S.: Distributed circle formation for anonymous oblivious robots. 3rd Workshop on Efficient and Experimental Algorithms, pp. 159–174 (2004)

  3. 3.

    Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829–879 (2012)

  4. 4.

    Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithms in asynchronous robots systems. SIAM J. Comput. 34(6), 1516–1528 (2005)

  5. 5.

    Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movements. SIAM J. Comput. 38(1), 276–302 (2008)

  6. 6.

    Das, S., Flocchini, P., Santoro, N., Yamashita, M.: Forming sequences of geometric patterns with oblivious mobile robots. Distrib. Comput. 28(2), 131–145 (2015)

  7. 7.

    Défago, X., Konagaya, A.: Circle formation for oblivious anonymous mobile robots with no common sense of orientation. 2nd ACM International Workshop on Principles of Mobile Computing (POMC), pp. 97–104 (2002)

  8. 8.

    Défago, X., Souissi, S.: Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity. Theor. Comput. Sci. 396(1–3), 97–112 (2008)

  9. 9.

    Dieudonné, Y., Labbani-Igbida, O., Petit, F.: Circle formation of weak mobile robots. ACM Trans. Auton. Adapt. Syst. 3(4), 16:1–16:20 (2008)

  10. 10.

    Dieudonné, Y., Levé, F., Petit, F., Villain, V.: Deterministic geoleader election in disoriented anonymous systems. Theor. Comput. Sci. 506, 43–54 (2013)

  11. 11.

    Dieudonné, Y., Petit, F.: Swing words to make circle formation quiescent. 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 166–179 (2007)

  12. 12.

    Dieudonné, Y., Petit, F.: Squaring the circle with weak mobile robots. 19th International Symposium on Algorithms and Computation (ISAAC), 354–365 (2008)

  13. 13.

    Flocchini, P., Prencipe, G., Santoro, N.: Self-deployment algorithms for mobile sensors on a ring. Theor. Comput. Sci. 402(1), 67–80 (2008)

  14. 14.

    Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by oblivious mobile robots. Synthesis lectures on distributed computing theory, Morgan & Claypool (2012)

  15. 15.

    Flocchini, P., Prencipe, G., Santoro, N., Viglietta, G.: Distributed computing by mobile robots: solving the uniform circle formation problem. In: Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), pp. 217–232 (2014)

  16. 16.

    Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Arbitrary pattern formation by asynchronous oblivious robots. Theor. Comput. Sci. 407(1–3), 412–447 (2008)

  17. 17.

    Fujinaga, N., Yamauchi, Y., Kijima, S., Yamashita, M.: Asynchronous pattern formation by anonymous oblivious mobile robots. SIAM J. Comput. 44(3), 740–785 (2015)

  18. 18.

    Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection. In: 18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 150–161 (2011)

  19. 19.

    Katreniak, B.: Biangular circle formation by asynchronous mobile robots. In: 12th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 185–199 (2005)

  20. 20.

    Izumi, T., Souissi, S., Katayama, Y., Inuzuka, N., Défago, X., Wada, K., Yamashita, M.: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. Comput. 41(1), 26–46 (2012)

  21. 21.

    Mamino, M., Viglietta, G.: Square formation by asynchronous oblivious robots. In: 28th Canadian Conference on Computational Geometry (CCCG), pp. 1–6 (2016)

  22. 22.

    Miyamae, T., Ichikawa, S., Hara, F.: Emergent approach to circle formation by multiple autonomous modular robots. J. Robot. Mechatron. 21(1), 3–11 (2009)

  23. 23.

    Oasa, Y., Suzuki, I., Yamashita, M.: A robust distributed convergence algorithm for autonomous mobile robots. In: IEEE International Conference on Systems, Man and Cybernetics, pp. 287–292 (1997)

  24. 24.

    Sugihara, K., Suzuki, I.: Distributed algorithms for formation of geometric patterns with many mobile robots. J. Robot. Syst. 13(3), 127–139 (1996)

  25. 25.

    Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28(4), 1347–1363 (1999)

  26. 26.

    Yamashita, M., Suzuki, I.: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theor. Comput. Sci. 411(26–28), 2433–2453 (2010)

Download references

Acknowledgements

The authors would like to thank the anonymous reviewers for helping improve the readability of the paper, Marc-André Paris-Cloutier for many helpful discussions and insights, and Peter Widmayer and Vincenzo Gervasi for sharing some of the fun and frustrations emerging from investigating this problem. This work has been supported in part by the Natural Sciences and Engineering Research Council of Canada under the Discovery Grants program, by Professor Flocchini’s University Research Chair, and by project PRA_2016_64 Through the fog funded by the University of Pisa.

Author information

Correspondence to Giuseppe Prencipe.

Additional information

Some of these results have been presented at the 18th International Conference on Principles of Distributed Systems [15].

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Flocchini, P., Prencipe, G., Santoro, N. et al. Distributed computing by mobile robots: uniform circle formation. Distrib. Comput. 30, 413–457 (2017). https://doi.org/10.1007/s00446-016-0291-x

Download citation

Keywords

  • Autonomous mobile robots
  • Uniform circle formation