Solving the moving target search problem using indistinguishable searchers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5641435 (Why is no real title available?)
- scientific article; zbMATH DE number 4110447 (Why is no real title available?)
- scientific article; zbMATH DE number 1239298 (Why is no real title available?)
- A polynomial time primal network simplex algorithm for minimum cost flows
- An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
- Branch and bound methods for a search problem
- Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
- Route optimization for multiple searchers
- Technical Note—The Complexity of the Optimal Searcher Path Problem
- The Optimal Search for a Moving Target When the Search Path Is Constrained
- Using multiple searchers in constrained-path, moving-target search problems
Cited in
(6)- Planning a multi-sensors search for a moving target considering traveling costs
- Search for a moving object in a problem with many searchers
- Multi-Agent Search for a Moving and Camouflaging Target
- Multiple searchers searching for a randomly distributed immobile target on a unit network
- The eye and the fist: optimizing search and interdiction
- Search for a moving element with the minimum total cardinality of tests
This page was built for publication: Solving the moving target search problem using indistinguishable searchers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1711443)
