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.
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 \(r_A\) and \(r_B\) 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.
- 12.Farrugia, A., Gąsieniec, L., Kuszner, Ł., Pacheco, E.: Deterministic rendezvous in restricted graphs. In: Italiano, G.F., Margaria-Steffen, T., Pokorný, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 189–200. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46078-8_16CrossRefGoogle Scholar