Alternating search at two locations

DOI10.1023/A:1011245715521MaRDI QIDQ5938010zbMATH OpenOpenAlexFDO

Authors Steve Alpern, J. V. Howard

Publication date 6 November 2002

Published in Dynamics and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1011245715521

zbMATH Keywords

circlerendezvous

Mathematics Subject Classification ID

Search theory (90B40) Programming involving graphs or networks (90C35) Control/observation systems governed by ordinary differential equations (93C15)

Recommendations

• Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
• Line-of-sight rendezvous
• Asymmetric rendezvous search on the circle
• Rendezvous Search on the Labeled Line
• Rendezvous search on the interval and the circle

Cited in

(12)

• Searching for multiple objects in multiple locations
• Static search games played over graphs and general metric spaces
• Line-of-sight rendezvous
• Ten Open Problems in Rendezvous Search
• Searching symmetric networks with Utilitarian-Postman paths
• Hide-and-seek games on a tree to which Eulerian networks are attached
• Asymmetric Rendezvous on the Line Is a Double Linear Search Problem
• On Submodular Search and Machine Scheduling
• scientific article; zbMATH DE number 7271257 (Why is no real title available?)
• Searching a variable speed network
• A new approach to Gal's theory of search games on weakly Eulerian networks
• Network search games with immobile hider, without a designated searcher starting point

This page was built for publication: Alternating search at two locations

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