Asymmetric rendezvous search on the circle
From MaRDI portal
Publication:1577517
DOI10.1023/A:1008339811950zbMATH Open0987.90047OpenAlexW1520998287MaRDI QIDQ1577517FDOQ1577517
Authors: Steve Alpern 
Publication date: 4 September 2000
Published in: Dynamics and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008339811950
Recommendations
- Rendezvous search on the interval and the circle
- Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
- Optimal symmetric rendezvous search on three locations
- Asymptotically optimal deterministic rendezvous
- The Rendezvous Search Problem
- Rendezvous search on a graph
- Asynchronous deterministic rendezvous in bounded terrains
- Asynchronous deterministic rendezvous in bounded terrains
- Rendezvous Search on the Line with Indistinguishable Players
Search theory (90B40) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Positional games (pursuit and evasion, etc.) (91A24)
Cited In (12)
- Strategy for quickest second meeting of two agents in two locations
- Alternating search at two locations
- Two point one sided rendezvous
- Line-of-sight rendezvous
- Search-and-rescue rendezvous
- Rendez-vous search on a rectangular lattice
- Rendezvous search on the edges of platonic solids: optimal waiting probabilities and multi-step strategies
- Rendezvous search on the interval and the circle
- Ten Open Problems in Rendezvous Search
- Hunter, Cauchy rabbit, and optimal Kakeya sets
- Rendezvous search on labeled networks
- Static search games played over graphs and general metric spaces
This page was built for publication: Asymmetric rendezvous search on the circle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1577517)
