Skip to main content

Gathering of Asynchronous Oblivious Robots with Limited Visibility

  • Conference paper
  • First Online:
STACS 2001 (STACS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2010))

Included in the following conference series:

Abstract

We consider a collection of robots which are identical (anony- mous), have limited visibility of the environment, and no memory of the past (oblivious); furthermore, they are totally asynchronous in their ac- tions, computations, and movements. We show that, even in such a to- tally asynchronous setting, it is possible for the robots to gather in the same location in finite time, provided they have a compass.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita. A Distributed Memoryless Point Convergence Algorithm for Mobile Robots with Limited Visibility. IEEE Trans. on Robotics and Autom., 15(5):818–828, 1999.

    Article  Google Scholar 

  2. G. Beni and S. Hackwood. Coherent Swarm Motion Under Distributed Control. In Proc. DARS’92, pages 39–52, 1992.

    Google Scholar 

  3. E. H. Durfee. Blissful Ignorance: Knowing Just Enough to Coordinate Well. In ICMAS, pages 406–413, 1995.

    Google Scholar 

  4. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. In ISAAC’ 99, pages 93–102.

    Google Scholar 

  5. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Limited Visibility Gathering by a Set of Autonomous Mobile Robots. Technical Report TR-00-09, Carleton University, 2000.

    Google Scholar 

  6. D. Jung, G. Cheng, and A. Zelinsky. Experiments in Realising Cooperation between Autonomous Mobile Robots. In 5th International Symposium on Experimental Robotics (ISER), June 1997.

    Google Scholar 

  7. Y. Kawauchi and M. Inaba and. T. Fukuda. A Principle of Decision Making of Cellular Robotic System (CEBOT). In Proc. IEEE Conf. on Robotics and Automation, pages 833–838, 1993.

    Google Scholar 

  8. M. J Matarić. Interaction and Intelligent Behavior. PhD thesis, MIT, May 1994.

    Google Scholar 

  9. S. Murata, H. Kurokawa, and S. Kokaji. Self-Assembling Machine. In Proc. IEEE Conf. on Robotics and Autom., pages 441–448, 1994.

    Google Scholar 

  10. K. Sugihara and I. Suzuki. Distributed Algorithms for Formation of Geometric Patterns with Many Mobile Robots. J. of Robotics Systems, 13:127–139, 1996.

    Article  MATH  Google Scholar 

  11. I. Suzuki and M. Yamashita. Distributed anonymous mobile robots. In Proc. of 3rd International Colloquium on Structural Information and Communication Complexity, pages 313–330, Siena, 1996.

    Google Scholar 

  12. I. Suzuki and M. Yamashita. Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM J. Comput., 28(4):1347–1363, 1999.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P. (2001). Gathering of Asynchronous Oblivious Robots with Limited Visibility. In: Ferreira, A., Reichel, H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44693-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-44693-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41695-1

  • Online ISBN: 978-3-540-44693-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics