Dynamic search for a moving target

DOI10.2307/3215037MaRDI QIDQ4305648zbMATH OpenOpenAlexFDO

Authors David Assaf, Ariela Sharlin-Bilitzky

Publication date 15 September 1994

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3215037

zbMATH Keywords

continuous time Markov processoptimal policyoptimal search intensityoptimality equationtwo boxes

Mathematics Subject Classification ID

Continuous-time Markov processes on discrete state spaces (60J27) Search theory (90B40) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Recommendations

• Optimal search for a randomly moving object
• scientific article; zbMATH DE number 3968305
• Optimal search for a moving target with the option to wait
• Optimal search for one of many objects hidden in two boxes
• Optimal Search for a Passing Target

Cited in

(28)

• Search for a fixed target by a moving object
• Optimal search for one of many objects hidden in two boxes
• A conjecture of Ross for a search problem
• Estimating the state of a noisy continuous time Markov chain when dynamic sampling is feasible
• A stochastic model for optimization of search for moving objects
• Finding a hider by an unknown deadline
• Search for a moving target in a competitive environment
• When is it best to follow the leader?
• Optimal search for a moving target
• Optimal search with time-dependent detection rate functions
• On maximum discounted effort reward search problem
• Optimal Search for a Passing Target
• OPTIMAL SEARCH AND STOP IN CONTINUOUS SEARCH PROCESS
• Optimal Search for an Object with Unknown type
• The Optimal Search for a Moving Target When the Search Path Is Constrained
• Optimal search for a randomly moving object
• Approximating an Infinite Stage Search Problem with a Finite Horizon Model
• Technical Note—An Upper Bound Useful in Optimizing Search for a Moving Target
• A sequential perspective on searching for static targets
• Infinite-horizon scheduling algorithms for optimal search for hidden objects
• scientific article; zbMATH DE number 919795 (Why is no real title available?)
• Optimal search for a moving target with the option to wait
• The search for an alerted moving target
• Discrete Search for an Intelligent Object: The Leprechaun's Problem
• When is information sufficient for action? search with unreliable yet informative intelligence
• On dichotomous search with direction-dependent costs for a uniformly hidden object
• Searching for a mobile hider in a directed bipartite graph
• Three problems in searching for a moving target between two sites

This page was built for publication: Dynamic search for a moving target

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