The Rendezvous Search Problem
From MaRDI portal
Publication:4841808
DOI10.1137/S0363012993249195zbMath0837.90074WikidataQ56171914 ScholiaQ56171914MaRDI QIDQ4841808
Publication date: 13 May 1996
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Related Items (58)
A symbolic programming approach to the rendezvous search problem ⋮ Collaboration Without Communication: Evacuating Two Robots from a Disk ⋮ Social distancing, gathering, search games: mobile agents on simple networks ⋮ Asynchronous deterministic rendezvous in graphs ⋮ Rendezvous of three agents on the line ⋮ Rendezvous search on labeled networks ⋮ Rendezvous in networks in spite of delay faults ⋮ 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* ⋮ Price of asynchrony in mobile agents computing ⋮ Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Integer programming models and algorithms for the graph decontamination problem with mobile agents ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Almost universal anonymous rendezvous in the plane ⋮ Fast rendezvous with advice ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Gathering of robots on anonymous grids and trees without multiplicity detection ⋮ Deterministic rendezvous in infinite trees ⋮ Rendezvous Problem ⋮ Ten Open Problems in Rendezvous Search ⋮ Many-player rendezvous search: Stick together or split and meet? ⋮ Rendezvous search when marks are left at the starting points ⋮ Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains ⋮ A common notion of clockwise can help in planar rendezvous ⋮ Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ How to meet in anonymous network ⋮ A search problem on a bipartite network ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Search-and-rescue rendezvous ⋮ Line-of-sight rendezvous ⋮ Time versus space trade-offs for rendezvous in trees ⋮ Gathering on rings under the look-compute-move model ⋮ Deterministic symmetric rendezvous with tokens in a synchronous torus ⋮ Minimizing the average searching time for an object within a graph ⋮ How to meet asynchronously at polynomial cost ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Note: Two rendezvous search problems on the line ⋮ Rendezvous Search with Revealed Information: Applications to the Line ⋮ An Algorithmic Theory of Mobile Agents ⋮ Gathering in the plane of location-aware robots in the presence of spies ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ 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 ⋮ Control Sequencing in a Game of Identity Pursuit-Evasion ⋮ Rendezvous search with markers that can be dropped at chosen times ⋮ Unnamed Item ⋮ Deterministic polynomial approach in the plane ⋮ Static search games played over graphs and general metric spaces ⋮ Two-agent tree evacuation ⋮ Anonymous meeting in networks
This page was built for publication: The Rendezvous Search Problem
