The Rendezvous Search Problem
From MaRDI portal
Recommendations
Cited in
(84)- Rendezvous search on the line with bounded resources: Expected time minimization
- The theory of search games and rendezvous.
- Asymmetric rendezvous search on the circle
- Symmetric rendezvous with advice: how to rendezvous in a disk
- A search problem on a bipartite network
- Use of information, memory and randomization in asynchronous gathering
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- A simultaneous search problem
- Minimizing the average searching time for an object within a graph
- Two-agent tree evacuation
- A symbolic programming approach to the rendezvous search problem
- Social distancing, gathering, search games: mobile agents on simple networks
- Search-and-rescue rendezvous
- Time versus space trade-offs for rendezvous in trees
- Gathering on rings under the look-compute-move model
- Rendezvous in planar environments with obstacles and unknown initial distance
- Deterministic rendezvous with different maps
- Deterministic polynomial approach in the plane
- Static search games played over graphs and general metric spaces
- Asynchronous deterministic rendezvous in graphs
- A common notion of clockwise can help in planar rendezvous
- Line-of-sight rendezvous
- Anonymous meeting in networks
- Rendezvous in networks in spite of delay faults
- Price of asynchrony in mobile agents computing
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
- Rendezvous search on the interval and the circle
- Optimal symmetric rendezvous search on three locations
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem
- Rendezvous problem
- Ten Open Problems in Rendezvous Search
- Different speeds suffice for rendezvous of two agents on arbitrary graphs
- Synchronous rendezvous for location-aware agents
- Rendezvous search with markers that can be dropped at chosen times
- Optimal trade-off between speed and acuity when searching for a small object
- Rendezvous in Higher Dimensions
- Rendez-vous search on a rectangular lattice
- Asynchronous Deterministic Rendezvous on the Line
- An Algorithmic Theory of Mobile Agents
- Two Dimensional Rendezvous Search
- Rendezvous Search: A Personal Perspective
- Note: Two rendezvous search problems on the line
- Rendezvous search on a graph
- Many-player rendezvous search: Stick together or split and meet?
- Rendezvous search when marks are left at the starting points
- scientific article; zbMATH DE number 2040791 (Why is no real title available?)
- Rendezvous of three agents on the line
- Rendezvous search on labeled networks
- Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting
- New results on rendezvous search on the interval
- scientific article; zbMATH DE number 1926678 (Why is no real title available?)
- scientific article; zbMATH DE number 1908188 (Why is no real title available?)
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
- Optimal rendezvous on a line by location-aware robots in the presence of spies*
- Rendezvous search on the edges of platonic solids: optimal waiting probabilities and multi-step strategies
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
- Collaboration without communication: evacuating two robots from a disk
- Integer programming models and algorithms for the graph decontamination problem with mobile agents
- Deterministic symmetric rendezvous with tokens in a synchronous torus
- Rendezvous Search with Revealed Information: Applications to the Line
- Discrete Search for an Intelligent Object: The Leprechaun's Problem
- Control sequencing in a game of identity pursuit-evasion
- Gathering despite mischief
- The rendezvous problem on discrete locations
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots
- Gathering in the plane of location-aware robots in the presence of spies
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
- Almost universal anonymous rendezvous in the plane
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
- Deterministic rendezvous in infinite trees
- Asynchronous deterministic rendezvous in bounded terrains
- Want to gather? No need to chatter!
- Fast deterministic rendezvous in labeled lines
- Exploiting automorphisms of temporal graphs for fast exploration and rendezvous
- Rendezvous search on a sphere: the astronaut problem
- Symmetry breaking in the plane. Rendezvous by robots with unknown attributes
- Romeo and juliet is ExpTime-complete
- Rendezvous search on a star graph with examination costs
- Fast rendezvous with advice
- Gathering of robots on anonymous grids and trees without multiplicity detection
- How to meet in anonymous network
- Two point one sided rendezvous
This page was built for publication: The Rendezvous Search Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4841808)
