Rendezvous on a Planar Lattice
Operations Research
Improved bounds for the symmetric rendezvous value on the line
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
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
Deterministic symmetric rendezvous with tokens in a synchronous torus
Discrete Applied Mathematics
Find-and-Fetch Search on a Tree
Operations Research
DISC 2011 invited lecture: deterministic rendezvous in networks: survey of models and results
DISC'11 Proceedings of the 25th international conference on Distributed computing
Synchronous rendezvous for location-aware agents
DISC'11 Proceedings of the 25th international conference on Distributed computing
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
Optimal Symmetric Rendezvous Search on Three Locations
Mathematics of Operations Research
Strategy for Quickest Second Meeting of Two Agents in Two Locations
Mathematics of Operations Research
Mobile agent rendezvous in a synchronous torus
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Model checking knowledge in pursuit evasion games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.00 |
The rendezvous-search problem was posed by the author 25years ago. In its basic form, it asks how two unit speed players can find each other in least expected time, when randomly placed in a known dark region. The problem received little attention until about 10 years ago. This article surveys the rapid progress that has been made since then, and also presents some new results.