Rendezvous search on the line with bounded resources: Expected time minimization

DOI10.1016/S0377-2217(96)00192-0zbMath0930.90043MaRDI QIDQ1278996

Steven Alpern, Anatole Beck

Publication date: 17 February 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00192-0

zbMATH Keywords

linear search problem; rendezvous search on the line

Mathematics Subject Classification ID

90B40: Search theory

91A05: 2-person games

Related Items

Note: Two rendezvous search problems on the line, Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks, Search-and-rescue rendezvous

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Search games
• On the linear search problem
• Linear search with bounded resources
• Finding Your Kids When They Are Lost
• Minimal Length Curves That Are Not Embeddable in an Open Planar Set: The Problem of a Lost Swimmer with a Compass
• Note: Two rendezvous search problems on the line
• Searching for targets who want to be found
• Rendezvous Search on the Line with More Than Two Players
• Minimax Rendezvous on the Line
• The Rendezvous Search Problem
• Rendezvous Search on the Line with Distinguishable Players
• Rendezvous Search on the Line with Indistinguishable Players
• Co-ordinating Two Searchers for an Object Hidden on an Interval
• The rendezvous problem on discrete locations