Rendezvous Search: A Personal Perspective
From MaRDI portal
Publication:3635138
DOI10.1287/opre.50.5.772.363zbMath1163.91324MaRDI QIDQ3635138
Publication date: 3 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.50.5.772.363
Related Items
Unnamed Item, 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*, Searching a Variable Speed Network, Gathering in the plane of location-aware robots in the presence of spies, Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks, Deterministic symmetric rendezvous with tokens in a synchronous torus, Equilibria of two-sided matching games with common preferences, Gathering of robots on meeting-points: feasibility and optimal resolution algorithms, Failure of common knowledge of language in common-interest communication games, Dynamic coordination via organizational routines, A symbolic programming approach to the rendezvous search problem, Social distancing, gathering, search games: mobile agents on simple networks, Byzantine gathering in polynomial time, Search-and-rescue rendezvous, Asynchronous approach in the plane: a deterministic polynomial algorithm, Static search games played over graphs and general metric spaces, Fast rendezvous on a cycle by agents with different speeds, Byzantine gathering in networks, A common notion of clockwise can help in planar rendezvous, Line-of-sight rendezvous, Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model, 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
