SIAM Journal on Control and Optimization
Agent Rendezvous: A Dynamic Symmetry-Breaking Problem
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Rendezvous Search on the Interval and the Circle
Operations Research
Two Dimensional Rendezvous Search
Operations Research
Rendezvous Search: A Personal Perspective
Operations Research
Mobile Agent Rendezvous in a Ring
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Rendezvous Search on the Labeled Line
Operations Research
Rendezvous Search on the Labeled Line
Operations Research
Mobile agent rendezvous in the ring
Mobile agent rendezvous in the ring
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Rendezvous on a Planar Lattice
Operations Research
Improved Bounds for the Symmetric Rendezvous Value on the Line
Operations Research
The power of tokens: rendezvous and symmetry detection for two mobile agents in a ring
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Black hole search with finite automata scattered in a synchronous torus
DISC'11 Proceedings of the 25th international conference on Distributed computing
Hi-index | 0.05 |
In the rendezvous problem, the goal for two mobile agents is to meet whenever this is possible. In the rendezvous with detection problem, an additional goal for the agents is to detect the impossibility of a rendezvous (e.g., due to symmetrical initial positions of the agents) and stop. We consider the rendezvous problem with and without detection for identical anonymous mobile agents (i.e., running the same deterministic algorithm) with tokens in an anonymous synchronous torus with a sense of direction, and show that there is a striking computational difference between one and more tokens. Specifically, we show that (1) two agents with a constant number of unmovable tokens, or with one movable token each, cannot rendezvous in an nxn torus if they have o(logn) memory, while they can solve the rendezvous with detection problem in an nxm torus as long as they have one unmovable token and O(logn+logm) memory; in contrast, (2) when two agents have two movable tokens each then the rendezvous problem (respectively, rendezvous with detection problem) is solvable with constant memory in an arbitrary nxm (respectively, nxn) torus; and finally, (3) two agents with three movable tokens each and constant memory can solve the rendezvous with detection problem in an nxm torus. This is the first publication in the literature that studies tradeoffs between the number of tokens, memory and knowledge the agents need in order to meet in a torus.