Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs

  • Evangelos Kranakis
  • Danny Krizanc
  • Euripides Markou
  • Aris Pagourtzis
  • Felipe Ramírez
Conference paper

DOI: 10.1007/978-3-319-51963-0_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10139)
Cite this paper as:
Kranakis E., Krizanc D., Markou E., Pagourtzis A., Ramírez F. (2017) Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs. In: Steffen B., Baier C., van den Brand M., Eder J., Hinchey M., Margaria T. (eds) SOFSEM 2017: Theory and Practice of Computer Science. SOFSEM 2017. Lecture Notes in Computer Science, vol 10139. Springer, Cham

Abstract

We consider the rendezvous problem for two robots on an arbitrary connected graph with n vertices and all its edges of length one. Two robots are initially located on two different vertices of the graph and can traverse its edges with different but constant speeds. The robots do not know their own speed. During their movement they are allowed to meet on either vertices or edges of the graph. Depending on certain conditions reflecting the knowledge of the robots we show that a rendezvous algorithm is always possible on a general connected graph.

More specifically, we give new rendezvous algorithms for two robots as follows. (1) In unknown topologies. We provide a polynomial time rendezvous algorithm based on universal exploration sequences, assuming that n is known to the robots. (2) In known topologies. In this case we prove the existence of more efficient rendezvous algorithms by considering the special case of the two-dimensional torus.

Keywords

Graph Mobile agents Rendezvous Speeds Universal exploration sequence 

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Evangelos Kranakis
    • 1
  • Danny Krizanc
    • 2
  • Euripides Markou
    • 3
  • Aris Pagourtzis
    • 4
  • Felipe Ramírez
    • 2
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada
  2. 2.Department of Mathematics and Computer ScienceWesleyan UniversityMiddletownUSA
  3. 3.Department of Computer Science and Biomedical InformaticsUniversity of ThessalyVolosGreece
  4. 4.School of Electronic and Computer EngineeringNational Technical University of AthensZografouGreece

Personalised recommendations