Optimal search for a randomly moving object

DOI10.2307/3214009zbMath0611.90064OpenAlexW2318536623MaRDI QIDQ3751362

Richard R. Weber

Publication date: 1986

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

Full work available at URL: https://semanticscholar.org/paper/573835161464ef01eeb4db863f83d99322ed4d14

zbMATH Keywords

moving objectoptimal search policyunobservable Markov process

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Search theory (90B40)

Related Items (4)

Estimating the state of a noisy continuous time Markov chain when dynamic sampling is feasible ⋮ Minimizing the average searching time for an object within a graph ⋮ Optimal search for a moving target with the option to wait ⋮ Optimal Search for a Moving Target

This page was built for publication: Optimal search for a randomly moving object