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: A Personal Perspective
Operations Research
Mobile Agent Rendezvous in a Ring
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Mobile agent rendezvous in the ring
Mobile agent rendezvous in the ring
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
Rendezvous of Mobile Agents When Tokens Fail Anytime
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Mobile agent rendezvous in a ring using faulty tokens
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
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
Randomized rendez-vous with limited memory
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Rendezvous of mobile agents in directed graphs
DISC'10 Proceedings of the 24th international conference on Distributed computing
Randomized rendezvous with limited memory
ACM Transactions on Algorithms (TALG)
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Randomized rendezvous of mobile agents in anonymous unidirectional ring networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Hi-index | 0.00 |
We consider the rendezvous problem for identical mobile agents (i.e., running the same deterministic algorithm) with tokens in a synchronous torus with a sense of direction and show that there is a striking computational difference between one and more tokens. More specifically, we show that 1) two agents with a constant number of unmovable tokens, or with one movable token, each cannot rendezvous if they have o(log n) memory, while they can perform rendezvous with detection as long as they have one unmovable token and O(log n) memory; in contrast, 2) when two agents have two movable tokens each then rendezvous (respectively, rendezvous with detection) is possible with constant memory in an arbitrary n × m (respectively, n × n) torus; and finally, 3) two agents with three movable tokens each and constant memory can perform rendezvous with detection in a n × m 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 such a network.