Technical Note—The Complexity of the Optimal Searcher Path Problem
From MaRDI portal
Recommendations
- The Optimal Search for a Moving Target When the Search Path Is Constrained
- An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
- PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
- Complexity of searching an immobile hider in a graph
- RANDOMIZED LOOK STRATEGY FOR A MOVING TARGET WHEN A SEARCH PATH IS GIVEN
Cited in
(29)- A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search
- General cops and robbers games with randomness
- Modeling sequential searches with ancillary target dependencies
- Scheduling an autonomous robot searching for hidden targets
- Optimal strategy of route and look for the path constrained search problem with reward criterion
- scientific article; zbMATH DE number 6672134 (Why is no real title available?)
- A search game when a search path is given
- A sequential perspective on searching for static targets
- Technical note: Trading off quick versus slow actions in optimal search
- Resource finding in store-and-forward networks
- On the computational complexity of the patrol boat scheduling problem with complete coverage
- Optimal search-relocation trade-off in Markovian-target searching
- Exact and Approximation Algorithms for the Expanding Search Problem
- Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
- A pathfinding problem for search trees with unknown edge length
- scientific article; zbMATH DE number 437569 (Why is no real title available?)
- Optimal search path for service in the presence of disruptions
- Complexity of searching an immobile hider in a graph
- Trajectory optimization under kinematical constraints for moving target search
- scientific article; zbMATH DE number 1535253 (Why is no real title available?)
- An innovative multi-agent search-and-rescue path planning approach
- Optimizing visibility-based search in polygonal domains
- Complexity of path discovery game problems
- Static target search path planning optimization with heterogeneous agents
- Solving the moving target search problem using indistinguishable searchers
- Honey-pot constrained searching with local sensory information
- Helicopter search problems, bandwidth and pathwidth
- Ant colony optimization for path planning in search and rescue operations
- Path optimization for the resource-constrained searcher
This page was built for publication: Technical Note—The Complexity of the Optimal Searcher Path Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4724426)
