Recommendations
Cited in
(41)- The Rendezvous Search Problem
- Time versus space trade-offs for rendezvous in trees
- Rendezvous in planar environments with obstacles and unknown initial distance
- On deterministic rendezvous at a node of agents with arbitrary velocities
- Anonymous meeting in networks
- Fast rendezvous with advice
- Deterministic rendezvous in infinite trees
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Rendezvous on a Planar Lattice
- Deterministic symmetric rendezvous with tokens in a synchronous torus
- A symbolic programming approach to the rendezvous search problem
- How to meet in anonymous network
- Use of information, memory and randomization in asynchronous gathering
- Rendezvous in Higher Dimensions
- Gathering despite mischief
- Two point one sided rendezvous
- The theory of search games and rendezvous.
- Price of asynchrony in mobile agents computing
- Symmetry breaking in the plane. Rendezvous by robots with unknown attributes
- Line-of-sight rendezvous
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Rendezvous in networks in spite of delay faults
- Asynchronous Deterministic Rendezvous on the Line
- Search-and-rescue rendezvous
- Rendezvous search with markers that can be dropped at chosen times
- Asynchronous deterministic rendezvous in graphs
- Rendezvous of heterogeneous mobile agents in edge-weighted networks
- A common notion of clockwise can help in planar rendezvous
- Fast deterministic rendezvous in labeled lines
- A further study on weak Byzantine gathering of mobile agents
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- Synchronous rendezvous for location-aware agents
- scientific article; zbMATH DE number 1908188 (Why is no real title available?)
- Asynchronous deterministic rendezvous in bounded terrains
- Rendezvous Search: A Personal Perspective
- Deterministic rendezvous with different maps
- Want to gather? No need to chatter!
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
- Rendezvous search on a sphere: the astronaut problem
- Deterministic meeting of sniffing agents in the plane
- Rendezvous search when marks are left at the starting points
This page was built for publication: Two Dimensional Rendezvous Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3634985)
