Asynchronous rendezvous with different maps

Serafino Cicerone, Gabriele Di Stefano, Leszek Gąsieniec, Alfredo Navarra

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

Abstract

This paper provides a study on the rendezvous problem in which two anonymous mobile entities referred to as robots rA and rB are asked to meet at an arbitrary node of a graph G = (V,E). As opposed to more standard assumptions robots may not be able to visit the entire graph G. Namely, each robot has its own map which is a connected subgraph of G. Such mobility restrictions may be dictated by the topological properties combined with the intrinsic characteristics of robots preventing them from visiting certain edges in E. We consider four different variants of the rendezvous problem introduced in [Farrugia et al. SOFSEM’15] which reflect on restricted maneuverability and navigation ability of rA and rB in G. In the latter, the focus is on models in which robots’ actions are synchronised. The authors prove that one of the maps must be a subgraph of the other. I.e., without this assumption (or some extra knowledge) the rendezvous problem does not have a feasible solution. In this paper, while we keep the containment assumption, we focus on asynchronous robots and the relevant bounds in the four considered variants. We provide some impossibility results and almost tight lower and upper bounds when the solutions are possible.

Original languageEnglish (US)
Title of host publicationStructural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, Proceedings
EditorsKeren Censor-Hillel, Michele Flammini
PublisherSpringer Verlag
Pages154-169
Number of pages16
ISBN (Print)9783030249212
DOIs
StatePublished - Jan 1 2019
Externally publishedYes
Event26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019 - L'Aquila, Italy
Duration: Jul 1 2019Jul 4 2019

Publication series

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

Conference

Conference26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019
CountryItaly
CityL'Aquila
Period7/1/197/4/19

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Asynchronous rendezvous with different maps'. Together they form a unique fingerprint.

  • Cite this

    Cicerone, S., Di Stefano, G., Gąsieniec, L., & Navarra, A. (2019). Asynchronous rendezvous with different maps. In K. Censor-Hillel, & M. Flammini (Eds.), Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, Proceedings (pp. 154-169). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11639 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-24922-9_11