Skip to main content

Brief Announcement: Mutually-Visible Uniform Circle Formation by Asynchronous Mobile Robots on Grid Plane

  • Conference paper
  • First Online:
Stabilization, Safety, and Security of Distributed Systems (SSS 2022)

Abstract

In this paper, we consider the Uniform Circle Formation problem, which is a problem to locate all robots uniformly (i.e., with equal central angle) on the circumference of a common circle on infinite grid plane. We first introduce an algorithm to achieve Uniform Circle Formation  using 5 colors with diameter \(\mathcal {O}(N)\), and present another algorithm to achieve Uniform Circle Formation satisfying Complete Visibility (i.e., no three robots are collinear) using 4 colors with diameter \(\mathcal {O}(N^2)\) (optimal) under assumptions such that robots agree on the only one axis, are opaque, operate asynchronously, and do not know the number of robots.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Lecture Notes in Computer Science, vol. 11340. Springer, Cham (2019)

    Google Scholar 

  3. R. Adhikary, M.K.Kundu, and B.Sau. Circle formation by asynchronous opaque robots on infinite grid. Comput. Sci. 22(1) (2021)

    Google Scholar 

Download references

Acknowledgements

This work was supported in part by JSPS KAKENHI Grant Numbers 19K11823, 20KK0232, and Foundation of Public Interest of Tatematsu.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Yoshiaki Ito , Yonghwan Kim or Yoshiaki Katayama .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ito, Y., Kim, Y., Katayama, Y. (2022). Brief Announcement: Mutually-Visible Uniform Circle Formation by Asynchronous Mobile Robots on Grid Plane. In: Devismes, S., Petit, F., Altisen, K., Di Luna, G.A., Fernandez Anta, A. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2022. Lecture Notes in Computer Science, vol 13751. Springer, Cham. https://doi.org/10.1007/978-3-031-21017-4_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-21017-4_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-21016-7

  • Online ISBN: 978-3-031-21017-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics