Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights

  • Takashi Okumura
  • Koichi WadaEmail author
  • Yoshiaki Katayama
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10616)


We study a Rendezvous problem for 2 autonomous mobile robots in asynchronous settings with persistent memory called light. It is well known that Rendezvous is impossible when robots have no lights in basic common models, even if the system is semi-synchronous. On the other hand, Rendezvous is possible if robots have lights with a constant number of colors in several types of lights [4, 10]. In asynchronous settings, Rendezvous can be solved by robots with 3 colors of lights in non-rigid movement and with 2 colors of lights in rigid movement, respectively [10], if robots can use not only own light but also other robot’s light (full-light), where non-rigid movement means robots may be stopped before reaching the computed destination but can move a minimum distance \(\delta >0\) and rigid movement means robots always reach the computed destination. In semi-synchronous settings, Rendezvous can be solved with 2 colors of full-lights in non-rigid movement.

In this paper, we show that in asynchronous settings, Rendezvous can be solved with 2 colors of full-lights in non-rigid movement if robots know the value of the minimum distance \(\delta \). We also show that Rendezvous can be solved with 2 colors of full-lights in non-rigid movement if we consider some reasonable restricted class of asynchronous settings.



This work is supported in part by KAKENHI no. 17K00019 and 15K00011.


  1. 1.
    Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36, 56–82 (2006)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Défago, X., Gradinariu Potop-Butucaru, M., Clément, J., Messika, S., Raipin Parvédy, P.: Fault and byzantine tolerant self-stabilizing mobile robots gathering - feasibility study -. CoRRabs/1602.05546 (2016)Google Scholar
  3. 3.
    Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by oblivious mobile robots. Synth. Lect. Distrib. Comput. Theor. 10, 1–171 (2012). Morgan & ClaypoolzbMATHGoogle Scholar
  4. 4.
    Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous with constant memory. Theoret. Comput. Sci. 621, 57–72 (2016)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Heriban, A., Défago, X., Tixeuil, S.: Optimally gathering two robots. Research report, HAL Id: hal-01575451, UPMC Sorbonne Universités, August 2017Google Scholar
  6. 6.
    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)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Okumura, T., Wada, K., Katayama, Y.: Optimal asynchronous rendezvous for mobile robots with lights. Technical report, arXiv:1707.04449v1, July 2017
  8. 8.
    Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theoret. Comput. Sci. 384(2–3), 222–231 (2007)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28, 1347–1363 (1999)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Viglietta, G.: Rendezvous of two robots with visible bits. Technical report, arXiv:1211.6039 (2012)

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Takashi Okumura
    • 1
  • Koichi Wada
    • 2
    Email author
  • Yoshiaki Katayama
    • 3
  1. 1.Graduate School of Science and EngineeringHosei UniversityTokyoJapan
  2. 2.Faculty of Science and EngineeringHosei UniversityTokyoJapan
  3. 3.Graduate School of EngineeringNagoya Institute of TechnologyNagoyaJapan

Personalised recommendations