On optimal search plans to detect a target moving randomly on the real line

DOI10.1016/0304-4149(85)90218-2zbMath0574.60076OpenAlexW2032500333MaRDI QIDQ1063940

John G. Wilson

Publication date: 1985

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-4149(85)90218-2

zbMATH Keywords

Fibonacci sequencesearch theorydeterministic search plan

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Cites Work

• Unnamed Item
• Theory of optimal search
• Search for a Moving Target: The FAB Algorithm
• Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets
• On a search for a moving target
• Optimal Search for a Moving Target in Discrete Time and Space
• Searching for a one-dimensional random walker

This page was built for publication: On optimal search plans to detect a target moving randomly on the real line