Publications Repository - Gdańsk University of Technology

In this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted by the topological properties of the graph space coupled with the intrinsic characteristics of robots preventing them from visiting certain edges in E:

Authors

• Ashley Farrugia,
• Leszek Gąsieniec,
• dr inż. Łukasz Kuszner link open in new tab ,
• Eduardo Pacheco