Deterministic Rendezvous in Restricted Graphs

  • Ashley Farrugia
  • Leszek Gąsieniec
  • Łukasz Kuszner
  • Eduardo Pacheco
Conference paper

DOI: 10.1007/978-3-662-46078-8_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8939)
Cite this paper as:
Farrugia A., Gąsieniec L., Kuszner Ł., Pacheco E. (2015) Deterministic Rendezvous in Restricted Graphs. In: Italiano G.F., Margaria-Steffen T., Pokorný J., Quisquater JJ., Wattenhofer R. (eds) SOFSEM 2015: Theory and Practice of Computer Science. SOFSEM 2015. Lecture Notes in Computer Science, vol 8939. Springer, Berlin, Heidelberg

Abstract

In this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V,E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted by the topological properties of the graph space coupled with the intrinsic characteristics of robots preventing them from visiting certain edges in E.

We consider three rendezvous models reflecting on restricted maneuverability of robots A and B. In Edge Monotonic Model each robot X ∈ {A,B} has weight wX and each edge in E has a weight restriction. Consequently, a robot X is only allowed to traverse edges with weight restrictions greater that wX. In the remaining two models graph G is unweighted and the restrictions refer to more arbitrary subsets of traversable nodes and edges. In particular, in Node Inclusive Model the set of nodes VX available to robot X, for X ∈ {A,B} satisfies the condition VA ⊆ VB or vice versa, and in Blind Rendezvous Model the relation between VA and VB is arbitrary. In each model we design and analyze efficient rendezvous algorithms. We conclude with a short discussion on the asynchronous case and related open problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Ashley Farrugia
    • 1
  • Leszek Gąsieniec
    • 1
  • Łukasz Kuszner
    • 2
  • Eduardo Pacheco
    • 3
  1. 1.Department of Computer ScienceUniversity of LiverpoolUK
  2. 2.Department of Algorithms & System ModelingGdańsk University of TechnologyPoland
  3. 3.School of Computer ScienceCarleton UniversityCanada

Personalised recommendations