Technical Note—The Complexity of the Optimal Searcher Path Problem
From MaRDI portal
Publication:4724426
DOI10.1287/opre.34.2.324zbMath0615.90072OpenAlexW2077042172MaRDI QIDQ4724426
K. E. Trummel, James Roger Weisinger
Publication date: 1986
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.34.2.324
Related Items (21)
General cops and robbers games with randomness ⋮ Scheduling an autonomous robot searching for hidden targets ⋮ Technical Note—Trading Off Quick versus Slow Actions in Optimal Search ⋮ An innovative multi-agent search-and-rescue path planning approach ⋮ Trajectory optimization under kinematical constraints for moving target search ⋮ Exact and Approximation Algorithms for the Expanding Search Problem ⋮ Complexity of searching an immobile hider in a graph ⋮ Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times ⋮ A sequential perspective on searching for static targets ⋮ Solving the moving target search problem using indistinguishable searchers ⋮ Static target search path planning optimization with heterogeneous agents ⋮ A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search ⋮ Modeling sequential searches with ancillary target dependencies ⋮ Path optimization for the resource-constrained searcher ⋮ Optimal search path for service in the presence of disruptions ⋮ Honey-pot constrained searching with local sensory information ⋮ Optimal search-relocation trade-off in Markovian-target searching ⋮ Resource finding in store-and-forward networks ⋮ Optimal strategy of route and look for the path constrained search problem with reward criterion ⋮ A search game when a search path is given ⋮ Ant colony optimization for path planning in search and rescue operations
This page was built for publication: Technical Note—The Complexity of the Optimal Searcher Path Problem
