Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Rendezvous Search: A Personal Perspective
Operations Research
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Deterministic Rendezvous in Graphs
Algorithmica
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
How to meet in anonymous network
Theoretical Computer Science
Deterministic Rendezvous in Trees with Little Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Asynchronous Deterministic Rendezvous on the Line
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Delays induce an exponential memory gap for rendezvous in trees
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
How to meet when you forget: log-space rendezvous in arbitrary graphs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The Mobile Agent Rendezvous Problem in the Ring
The Mobile Agent Rendezvous Problem in the Ring
How to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Almost optimal asynchronous rendezvous in infinite multidimensional grids
DISC'10 Proceedings of the 24th international conference on Distributed computing
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Space-optimal rendezvous of mobile agents in asynchronous trees
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Mobile robots gathering algorithm with local weak multiplicity in rings
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Asynchronous rendezvous of anonymous agents in arbitrary graphs
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Hi-index | 0.00 |
Two or more mobile entities, called agents or robots, starting at distinct initial positions in some environment, have to meet. This task is known in the literature as rendezvous. Among many alternative assumptions that have been used to study the rendezvous problem, two most significantly influence the methodology appropriate for its solution. The first of these assumptions concerns the environment in which the mobile entities navigate: it can be either a terrain in the plane, or a network modeled as an undirected graph. In the case of networks, methods and results further depend on whether the agents have the ability to mark nodes in some way. The second assumption concerns the way in which the entities move: it can be either deterministic or randomized. In this paper we survey models and results concerning deterministic rendezvous in networks, where agents cannot mark nodes.