Rendezvous on a Planar Lattice

DOI10.1287/OPRE.1050.0217zbMATH Open1165.91336OpenAlexW1988449913MaRDI QIDQ5322153FDOQ5322153

Authors: Vic Baston, Steve Alpern 

Publication date: 18 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1050.0217

Recommendations

• scientific article; zbMATH DE number 1908188
• Two Dimensional Rendezvous Search
• Rendezvous in Higher Dimensions
• A common notion of clockwise can help in planar rendezvous
• Rendezvous Search on the Line with Distinguishable Players

Mathematics Subject Classification ID

Search theory (90B40) 2-person games (91A05) Games involving graphs (91A43) Combinatorial games (91A46)

Cited In (7)

• Deterministic symmetric rendezvous with tokens in a synchronous torus
• Rendezvous in Higher Dimensions
• Two point one sided rendezvous
• Line-of-sight rendezvous
• A common notion of clockwise can help in planar rendezvous
• On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
• Static search games played over graphs and general metric spaces

This page was built for publication: Rendezvous on a Planar Lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322153)