skip to main content
10.1145/3154273.3154313acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicdcnConference Proceedingsconference-collections
short-paper

Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication

Published:04 January 2018Publication History

ABSTRACT

The evacuation of mobile robots is an interesting emerging application in distributed computing. This paper considers the fundamental problem of how to evacuate two robots from a unit disk. The robots, initially located at the center of the disk, need to exit the disk through two unknown exits, at known distance d from each other, located at the perimeter of the disk. The robots can coordinate when exploring the disk, using wireless communication. The objective is to minimize the evacuation time, i.e., the time until the last robot exits the disk. We consider two different model variants, where exits can either be labeled or unlabeled. We complement our analysis with simulations.

References

  1. Rudolf Ahlswede and Ingo Wegener. 1987. Search problems. Wiley-Interscience. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Anthony Bonato and Richard J Nowakowski. 2011. The game of cops and robbers on graphs. Vol. 61. American Mathematical Society Providence.Google ScholarGoogle Scholar
  3. Sebastian Brandt, Felix Laufenberg, Yuezhou Lv, David Stolz, and Roger Wattenhofer. 2017. Collaboration Without Communication: Evacuating Two Robots from a Disk. In Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings. 104--115.Google ScholarGoogle Scholar
  4. Timothy H. Chung, Geoffrey A. Hollinger, and Volkan Isler. 2011. Search and pursuit-evasion in mobile robotics. Autonomous Robots 31, 4 (2011), 299. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Jurek Czyzowicz, Stefan Dobrev, Konstantinos Georgiou, Evangelos Kranakis, and Fraser MacQuarrie. 2016. Evacuating two robots from multiple unknown exits in a circle. In Proceedings of the 17th International Conference on Distributed Computing and Networking, Singapore, January 4-7, 2016. 28:1--28:8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Jurek Czyzowicz, Leszek Gasieniec, Thomas Gorry, Evangelos Kranakis, Russell Martin, and Dominik Pajak. 2014. Evacuating Robots via Unknown Exit in a Disk. In Distributed Computing -28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings. 122--136.Google ScholarGoogle Scholar
  7. Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jaroslav Opatrny, and Birgit Vogtenhuber. 2015. Evacuating Robots from a Disk Using Face-to-Face Communication. CoRR abs/1501.04985 (2015). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Ioannis Lamprou, Russell Martin, and Sven Schewe. 2016. Fast Two-Robot Disk Evacuation with Wireless Communication. In Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings. 1--15.Google ScholarGoogle Scholar
  9. Paul J Nahin. 2012. Chases and escapes: the mathematics of pursuit and evasion. Princeton University Press.Google ScholarGoogle Scholar
  10. Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal, and Stefan Schmid. 2017. Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk. CoRR abs/1708.03792 (2017). http://arxiv.org/abs/1708.03792Google ScholarGoogle Scholar
  11. Lawrence D Stone. 1976. Theory of optimal search. Vol. 118. Elsevier.Google ScholarGoogle Scholar

Index Terms

  1. Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk with Wireless Communication

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ICDCN '18: Proceedings of the 19th International Conference on Distributed Computing and Networking
      January 2018
      494 pages
      ISBN:9781450363723
      DOI:10.1145/3154273

      Copyright © 2018 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 4 January 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • short-paper
      • Research
      • Refereed limited

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader