Rendezvous search when marks are left at the starting points
From MaRDI portal
Publication:4330236
DOI10.1002/nav.1044zbMath0992.90035OpenAlexW2030068303MaRDI QIDQ4330236
Publication date: 15 May 2002
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.1044
Related Items (27)
A symbolic programming approach to the rendezvous search problem ⋮ Asynchronous deterministic rendezvous in graphs ⋮ Rendezvous in networks in spite of delay faults ⋮ Price of asynchrony in mobile agents computing ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Fast rendezvous with advice ⋮ Rendezvous of heterogeneous mobile agents in edge-weighted networks ⋮ How to meet when you forget: log-space rendezvous in arbitrary graphs ⋮ Deterministic rendezvous in infinite trees ⋮ Overcoming probabilistic faults in disoriented linear search ⋮ On deterministic rendezvous at a node of agents with arbitrary velocities ⋮ How to meet in anonymous 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 ⋮ Deterministic symmetric rendezvous with tokens in a synchronous torus ⋮ 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 ⋮ Synchronous Rendezvous for Location-Aware Agents ⋮ Deterministic rendezvous with different maps ⋮ Rendezvous search with markers that can be dropped at chosen times ⋮ Unnamed Item ⋮ Anonymous meeting in networks ⋮ Fast rendezvous on a cycle by agents with different speeds
Cites Work
- Dynamic focal points in \(N\)-person coordination games
- Yet more on the linear search problem
- Rendezvous Search on the Interval and the Circle
- Learning How to Cooperate: Optimal Play in Repeated Coordination Games
- Two Dimensional Rendezvous Search
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
- Note: Two rendezvous search problems on the line
- The Rendezvous Search Problem
- Rendezvous Search on the Line with Distinguishable Players
- Rendezvous Search on the Line with Indistinguishable Players
This page was built for publication: Rendezvous search when marks are left at the starting points
