Skip to main content

Uniform Circle Formation by Swarm Robots Under Limited Visibility

  • Conference paper
  • First Online:
Distributed Computing and Internet Technology (ICDCIT 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11969))

Abstract

This paper proposes a distributed algorithm for uniform circle formation by multiple autonomous, asynchronous, oblivious mobile swarm robots. Each robot executes cycle of look-compute-move repeatedly. All robots agree upon a common origin and axes. Eventually an uniform circle of a given radius and center is formed without any collision or deadlock.

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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. Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theor. Comput. Sci. 410, 481–499 (2009)

    Article  MathSciNet  Google Scholar 

  2. Efrima, A., Peleg, D.: Distributed algorithms for partitioning a swarm of autonomous mobile robots. Theor. Comput. Sci. 410, 1355–1368 (2009)

    Article  MathSciNet  Google Scholar 

  3. Uny, C.Y., Fukunaga, A.S., Kahng, A.B.: Cooperative mobile robotics: antecedents and directions. Auton. Robot. 4, 1–23 (1997)

    Google Scholar 

  4. Flocchini, P., Prencipe, G., Santoro, N., Viglietta, G.: Distributed computing by mobile robots: solving the uniform circle formation problem. In: Aguilera, M.K., Querzoni, L., Shapiro, M. (eds.) OPODIS 2014. LNCS, vol. 8878, pp. 217–232. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-14472-6_15

    Chapter  Google Scholar 

  5. Mamino, M., Viglietta, G.: Square formation by asynchronous oblivious robots. In: Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016 (2016)

    Google Scholar 

  6. Dutta, A., Gan Chaudhuri, S., Datta, S., Mukhopadhyaya, K.: Circle formation by asynchronous fat robots with limited visibility. In: Ramanujam, R., Ramaswamy, S. (eds.) ICDCIT 2012. LNCS, vol. 7154, pp. 83–93. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28073-3_8

    Chapter  Google Scholar 

  7. Mondal, M., Gan Chaudhuri, S.: Uniform circle formation by mobile robots. In: Proceedings of the Workshop Program of the 19th International Conference on Distributed Computing and Networking, Article No. 20 (ICDCN 2018) (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Moumita Mondal or Sruti Gan Chaudhuri .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mondal, M., Gan Chaudhuri, S. (2020). Uniform Circle Formation by Swarm Robots Under Limited Visibility. In: Hung, D., D´Souza, M. (eds) Distributed Computing and Internet Technology. ICDCIT 2020. Lecture Notes in Computer Science(), vol 11969. Springer, Cham. https://doi.org/10.1007/978-3-030-36987-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-36987-3_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-36986-6

  • Online ISBN: 978-3-030-36987-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics