Asymmetric rendezvous on the plane
Proceedings of the fourteenth annual symposium on Computational geometry
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Rendezvous-Evasion Search in Two Boxes
Operations Research
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
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
Asynchronous Deterministic Rendezvous on the Line
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
An algorithmic theory of mobile agents
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Randomized rendez-vous with limited memory
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
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
How to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Tell me where i am so i can meet you sooner: asynchronous rendezvous with location information
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Almost optimal asynchronous rendezvous in infinite multidimensional grids
DISC'10 Proceedings of the 24th international conference on Distributed computing
Deterministic symmetric rendezvous with tokens in a synchronous torus
Discrete Applied Mathematics
Randomized rendezvous with limited memory
ACM Transactions on Algorithms (TALG)
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science
Synchronous rendezvous for location-aware agents
DISC'11 Proceedings of the 25th international conference on Distributed computing
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
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
Asynchronous deterministic rendezvous in bounded terrains
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
User cooperation and search in intelligent networks
WAC'05 Proceedings of the Second international IFIP conference on Autonomic Communication
Mobile agent rendezvous in a synchronous torus
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Asynchronous rendezvous of anonymous agents in arbitrary graphs
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Model checking knowledge in pursuit evasion games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Time vs. space trade-offs for rendezvous in trees
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
How to meet asynchronously (almost) everywhere
ACM Transactions on Algorithms (TALG)
Gathering of robots on anonymous grids without multiplicity detection
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
How to gather asynchronous oblivious robots on anonymous rings
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Delays Induce an Exponential Memory Gap for Rendezvous in Trees
ACM Transactions on Algorithms (TALG)
How to meet asynchronously at polynomial cost
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Deterministic polynomial approach in the plane
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Price of asynchrony in mobile agents computing
Theoretical Computer Science
| Hi-index | 0.01 |
The author considers the problem faced by two people who are placed randomly in a known search region and move about at unit speed to find each other in the least expected time. This time is called the rendezvous value of the region. It is shown how symmetries in the search region may hinder the process by preventing coordination based on concepts such as north or clockwise. A general formulation of the rendezvous search problem is given for a compact metric space endowed with a group of isometrics which represents the spatial uncertainties of the players. These concepts are illustrated by considering upper bounds for various rendezvous values for the circle and an arbitrary metric network. The discrete rendezvous problem on a cycle graph for players restricted to symmetric Markovian strategies is then solved. Finally, the author considers the problem faced by two people on an infinite line who each know the distribution of the distance but not the direction to each other.