The Optimal Search for a Moving Target When the Search Path Is Constrained
From MaRDI portal
Publication:3675866
DOI10.1287/opre.32.5.1107zbMath0562.90035MaRDI QIDQ3675866
Publication date: 1984
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.32.5.1107
partially observable Markov decision process; finite set of cells; known transition probabilities; optimal search for moving target
Related Items
Planning and acting in partially observable stochastic domains, A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search, Optimal search-relocation trade-off in Markovian-target searching, A hierarchical approach for planning a multisensor multizone search for a moving target, Honey-pot constrained searching with local sensory information, A survey of algorithmic methods for partially observed Markov decision processes