Asynchronous Rendezvous with Different Maps

This paper provides a study on the rendezvous problem in which two anonymous mobile entities referred to as robots \(r_A\) and \(r_B\) 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.

[1]  Andrzej Pelc,et al.  Deterministic rendezvous in networks: A comprehensive survey , 2012, Networks.

[2]  Andrzej Pelc,et al.  How to meet asynchronously (almost) everywhere , 2010, SODA '10.

[3]  Andrzej Pelc,et al.  Time versus space trade-offs for rendezvous in trees , 2013, Distributed Computing.

[4]  Andrzej Pelc,et al.  Rendezvous in networks in spite of delay faults , 2015, Distributed Computing.

[5]  Zhaoquan Gu,et al.  Rendezvous in Distributed Systems , 2017, Springer Singapore.

[6]  Maria Gradinariu Potop-Butucaru,et al.  On asynchronous rendezvous in general graphs , 2019, Theor. Comput. Sci..

[7]  Nicola Santoro,et al.  Rendezvous with constant memory , 2016, Theor. Comput. Sci..

[8]  Andrzej Pelc,et al.  Fault-Tolerant Rendezvous in Networks , 2014, ICALP.

[9]  Andrzej Pelc,et al.  Asynchronous Deterministic Rendezvous in Graphs , 2005, MFCS.

[10]  Zhaoquan Gu,et al.  Blind Rendezvous Problem , 2017 .

[11]  Eduardo Pacheco,et al.  Deterministic Rendezvous in Restricted Graphs , 2015, SOFSEM.

[12]  Andrzej Pelc,et al.  How to meet asynchronously at polynomial cost , 2013, PODC '13.

[13]  Andrzej Pelc,et al.  How to meet when you forget: log-space rendezvous in arbitrary graphs , 2010, Distributed Computing.

[14]  Adrian Kosowski,et al.  Rendezvous of heterogeneous mobile agents in edge-weighted networks , 2015, Theor. Comput. Sci..

[15]  Giovanni Viglietta.  Rendezvous of Two Robots with Visible Bits , 2013, ALGOSENSORS.

[16]  Shantanu Das,et al.  Distributed Evacuation in Graphs with Multiple Exits , 2016, SIROCCO.

[17]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003, ESA.