Deterministic rendezvous with different maps (Q2323344)

The paper treats the problem of rendezvous in which anonymous mobile entities are asked to meet at a particular node in the network modelled by an arbitrary undirected graph under the condition that the accessibility to nodes and edges of participating mobile entities may differ. Several variants of restricted accessibility for both synchronous and asynchronous models are considered. In the synchronous model the mobile units have access to the global clock ticking in discrete time steps, while in the asynchronous model each mobile entity computes its trajectory without access to the global clock. The problem is studied from a theoretical point of view. Rendezvous algorithms are introduced for each case and the time complexity is analyzed in depth.