Discrete Search for an Intelligent Object: The Leprechaun's Problem

DOI10.1017/S0269964800004411MaRDI QIDQ5485376zbMATH OpenFDO

Authors Scott M. Berry

Publication date 30 August 2006

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0269964800004411

Mathematics Subject Classification ID

Search theory (90B40) Other game-theoretic models (91A40)

Recommendations

• Optimal search for a moving target
• Optimal search for a randomly moving object
• Dynamic search for a moving target
• The discrete search problem and the construction of optimal allocations
• Continuous and discrete search for one of many objects

Cites work

• A Simple Model of Search for a Moving Target
• scientific article; zbMATH DE number 3906232 (Why is no real title available?)
• Optimal Search of a Moving Target
• The rendezvous problem on discrete locations
• The Rendezvous Search Problem

Cited in

(1)

• Optimal search for a moving target

This page was built for publication: Discrete Search for an Intelligent Object: The Leprechaun's Problem

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