A Simple Model of Search for a Moving Target

DOI10.1287/OPRE.18.5.883MaRDI QIDQ5605040zbMATH OpenOpenAlexFDO

Authors Stephen M. Pollock

Publication date 1970

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.18.5.883

Mathematics Subject Classification ID

Search theory (90B40)

Cited in

(13)

• A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search
• Optimal search for a moving target with the option to wait
• Optimal search-relocation trade-off in Markovian-target searching
• On a search for a moving target
• Search for a moving target in a competitive environment
• A competitive search game with a moving target
• Discrete Search for an Intelligent Object: The Leprechaun's Problem
• A conjecture of Ross for a search problem
• Optimal information acquisition for a linear quadratic control problem
• The problem of optimal stopping in a partially observable Markov chain
• Optimal search for a moving target
• Monotone control laws for noisy, countable-state Markov chains
• Multi-objective search game: long-term vs short-term

This page was built for publication: A Simple Model of Search for a Moving Target

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