@article{326ea70e33ce4765a6a98bc798e0b20d,
title = "Deterministic rendezvous with different maps",
abstract = "We consider a rendezvous problem in which two identical anonymous mobile entities A and B, called later robots, are asked to meet at some node in the network modelled by an arbitrary undirected graph G=(V,E). Most of the work devoted to rendezvous in graphs assumes robots have access to the same sets of nodes and edges, and the topology of connections is either known or unknown to the robots. In this work we assume that each robot may access only specific nodes and edges in G of which full map is given to the robot in advance. We consider three variants of rendezvous differentiated by the level of restricted maneuverability of robots in both synchronous and asynchronous models of computation. In each adopted variant and model of computation we study feasibility of rendezvous, and if rendezvous is possible we propose the relevant algorithms and discuss their efficiency.",
keywords = "Distributed algorithm, Mobile agents, Rendezvous",
author = "Ashley Farrugia and Leszek G{\c a}sieniec and {\L}ukasz Kuszner and Eduardo Pacheco",
note = "Funding Information: Research partially supported by the Polish National Science Center grant DEC-2011/02/A/ST6/00201 and by Network Sciences and Technologies initiative at University of Liverpool. An extended abstract of this work appeared in Proc. 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015) [29].? Research partially supported by the Polish National Science Center grant DEC-2011/02/A/ST6/00201 and by Network Sciences and Technologies initiative at University of Liverpool. An extended abstract of this work appeared in Proc. 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015) [29]. We would like to thank the anonymous reviewers for valuable comments which led to improved quality and clarity of the presentation.? Research partially supported by the Polish National Science Center grant DEC-2011/02/A/ST6/00201 and by Network Sciences and Technologies initiative at University of Liverpool. An extended abstract of this work appeared in Proc. 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015) [29]. Funding Information: Research partially supported by the Polish National Science Center grant DEC-2011/02/A/ST6/00201 and by Network Sciences and Technologies initiative at University of Liverpool. An extended abstract of this work appeared in Proc. 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015) [29].☆ Research partially supported by the Polish National Science Center grant DEC-2011/02/A/ST6/00201 and by Network Sciences and Technologies initiative at University of Liverpool. An extended abstract of this work appeared in Proc. 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015) [29]. We would like to thank the anonymous reviewers for valuable comments which led to improved quality and clarity of the presentation.☆ Research partially supported by the Polish National Science Center grant DEC-2011/02/A/ST6/00201 and by Network Sciences and Technologies initiative at University of Liverpool. An extended abstract of this work appeared in Proc. 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015) [29]. Publisher Copyright: {\textcopyright} 2019 Elsevier Inc.",
year = "2019",
month = dec,
doi = "10.1016/j.jcss.2019.06.001",
language = "English (US)",
volume = "106",
pages = "49--59",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
}