The rendezvous problem on discrete locations
From MaRDI portal
Publication:5750705
DOI10.2307/3214827zbMath0718.90047OpenAlexW2103469743WikidataQ56171917 ScholiaQ56171917MaRDI QIDQ5750705
Edward J. Anderson, Richard R. Weber
Publication date: 1990
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/818e3d251c02c8ebd1b480a91c7fb989aa32422f
Related Items (32)
A symbolic programming approach to the rendezvous search problem ⋮ Social distancing, gathering, search games: mobile agents on simple networks ⋮ Asynchronous deterministic rendezvous in graphs ⋮ Rendezvous in networks in spite of delay faults ⋮ Price of asynchrony in mobile agents computing ⋮ Rendezvous search on a star graph with examination costs ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Almost universal anonymous rendezvous in the plane ⋮ Codes, lower bounds, and phase transitions in the symmetric rendezvous problem ⋮ Fast rendezvous with advice ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Rendezvous Problem ⋮ Ten Open Problems in Rendezvous Search ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ How to meet in anonymous network ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Search-and-rescue rendezvous ⋮ Time versus space trade-offs for rendezvous in trees ⋮ How to meet asynchronously at polynomial cost ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Rendezvous Search with Revealed Information: Applications to the Line ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Rendezvous search on the line with bounded resources: Expected time minimization ⋮ Discrete Search for an Intelligent Object: The Leprechaun's Problem ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Deterministic rendezvous with different maps ⋮ On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous ⋮ Rendezvous search with markers that can be dropped at chosen times ⋮ Unnamed Item ⋮ Deterministic polynomial approach in the plane ⋮ Anonymous meeting in networks
This page was built for publication: The rendezvous problem on discrete locations
