Deterministic rendezvous in restricted graphs

Ashley Farrugia, Leszek Gąsieniec, Łukasz Kuszner, Eduardo Pacheco

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationSOFSEM 2015
Subtitle of host publicationTheory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science,
EditorsTiziana Margaria-Steffen, Giuseppe F. Italiano, Jean-Jacques Quisquater, Roger Wattenhofer, Jaroslav Pokorný
PublisherSpringer Verlag
Pages189-200
Number of pages12
ISBN (Electronic)9783662460771
StatePublished - Jan 1 2015
Externally publishedYes
Event41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015 - Pec pod Sněžkou, Czech Republic
Duration: Jan 24 2015Jan 29 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8939
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015
CountryCzech Republic
CityPec pod Sněžkou
Period1/24/151/29/15

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Farrugia, A., Gąsieniec, L., Kuszner, Ł., & Pacheco, E. (2015). Deterministic rendezvous in restricted graphs. In T. Margaria-Steffen, G. F. Italiano, J-J. Quisquater, R. Wattenhofer, & J. Pokorný (Eds.), SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, (pp. 189-200). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8939). Springer Verlag.