The Optimal Search for a Moving Target When the Search Path Is Constrained

DOI10.1287/opre.32.5.1107zbMath0562.90035OpenAlexW1966283062MaRDI QIDQ3675866

James N. Eagle

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

zbMATH Keywords

partially observable Markov decision processfinite set of cellsknown transition probabilitiesoptimal search for moving target

Mathematics Subject Classification ID

Search theory (90B40) Markov and semi-Markov decision processes (90C40)

Related Items (14)

A survey of algorithmic methods for partially observed Markov decision processes ⋮ A DC programming approach for planning a multisensor multizone search for a target ⋮ Trajectory optimization under kinematical constraints for moving target search ⋮ How patient compliance impacts the recommendations for colorectal cancer screening ⋮ A Based-DC Programming Approach for Planning a Multisensor Multizone Search for a Moving Target ⋮ Solving the moving target search problem using indistinguishable searchers ⋮ Moving target search optimization -- a literature review ⋮ Nonstationary Bandits with Habituation and Recovery Dynamics ⋮ A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search ⋮ Planning and acting in partially observable stochastic domains ⋮ Honey-pot constrained searching with local sensory information ⋮ Optimal search-relocation trade-off in Markovian-target searching ⋮ A hierarchical approach for planning a multisensor multizone search for a moving target ⋮ A leader-follower partially observed, multiobjective Markov game

This page was built for publication: The Optimal Search for a Moving Target When the Search Path Is Constrained