Two Dimensional Rendezvous Search

DOI10.1287/opre.49.1.107.11191zbMath1163.90525MaRDI QIDQ3634985

Sándor P. Fekete, Edward J. Anderson

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.49.1.107.11191

zbMATH Keywords

Military; Marking strategies on the geometric plane

Mathematics Subject Classification ID

90B40: Search theory

91A24: Positional games (pursuit and evasion, etc.)

Related Items

Rendezvous search when marks are left at the starting points, How to meet asynchronously at polynomial cost, On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous, Deterministic Rendezvous with Detection Using Beeps, Time versus cost tradeoffs for deterministic rendezvous in networks, Anonymous meeting in networks, Deterministic symmetric rendezvous with tokens in a synchronous torus, Asynchronous deterministic rendezvous in bounded terrains, Fast rendezvous with advice, Rendezvous of heterogeneous mobile agents in edge-weighted networks, How to meet in anonymous network, Two point one sided rendezvous, On deterministic rendezvous at a node of agents with arbitrary velocities, 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, Time versus space trade-offs for rendezvous in trees, Asynchronous deterministic rendezvous in graphs, A common notion of clockwise can help in planar rendezvous, Line-of-sight rendezvous, Rendezvous in networks in spite of delay faults, Price of asynchrony in mobile agents computing, Deterministic Meeting of Sniffing Agents in the Plane, Synchronous Rendezvous for Location-Aware Agents, Asynchronous Deterministic Rendezvous on the Line