Using multiple searchers in constrained-path, moving-target search problems

DOI10.1002/(SICI)1520-6750(199606)43:4%3C463::AID-NAV1%3E3.0.CO;2-5MaRDI QIDQ4883164zbMATH OpenOpenAlexFDO

Authors Robert Dell, James N. Eagle, Gustavo H. A. Martins, Almir Garnier Santos

Publication date 1 July 1996

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199606)43:4%3C463::aid-nav1%3E3.0.co;2-5

zbMATH Keywords

branch-and-boundconstrained-path problemsheuristicsmultiple-searcher, moving-target search problem

Mathematics Subject Classification ID

Search theory (90B40)

Recommendations

• Criteria and approximate methods for path-constrained moving-target search problems
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
• Route optimization for multiple searchers
• Moving target search optimization -- a literature review
• scientific article; zbMATH DE number 739166

Cited in

(36)

• Optimal search-relocation trade-off in Markovian-target searching
• A hierarchical approach for planning a multisensor multizone search for a moving target
• Sensor planning for elusive targets
• State-space search strategies gleaned from animal behavior: A traveling salesman experiment
• Trajectory optimization under kinematical constraints for moving target search
• Solving the moving target search problem using indistinguishable searchers
• Moving target search optimization -- a literature review
• Search for a moving object in a problem with many searchers
• Time-critical testing and search problems
• Aerial vehicle search-path optimization: a novel method for emergency operations
• Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
• Optimal search strategies using simultaneous generalized hill climbing algorithms
• Performance of a class of multi-robot deploy and search strategies based on centroidal Voronoi configurations
• Path integration mediated systematic search: a Bayesian model
• Route optimization for multiple searchers
• Technical note: Trading off quick versus slow actions in optimal search
• Path optimization for the resource-constrained searcher
• The increasing cost tree search for optimal multi-agent pathfinding
• scientific article; zbMATH DE number 67464 (Why is no real title available?)
• Branch and bound methods for a search problem
• scientific article; zbMATH DE number 2040791 (Why is no real title available?)
• Criteria and approximate methods for path-constrained moving-target search problems
• scientific article; zbMATH DE number 1368831 (Why is no real title available?)
• A Multi-Stage Model of Searching for Two Mobile Objects on a Graph
• Static target search path planning optimization with heterogeneous agents
• Multiple searchers searching for a randomly distributed immobile target on a unit network
• A based-DC programming approach for planning a multisensor multizone search for a moving target
• scientific article; zbMATH DE number 2246328 (Why is no real title available?)
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
• A Constraint Optimization Approach for the Allocation of Multiple Search Units in Search and Rescue Operations
• Multi-Agent Search for a Moving and Camouflaging Target
• Following the trail: an analysis of the path constrained trail-based moving target problem
• Scheduling an autonomous robot searching for hidden targets
• Investigating the benefits of re-optimisation while searching for two immobile entities on a network
• An information theoretic based integer linear programming approach for the discrete search path planning problem
• A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search

This page was built for publication: Using multiple searchers in constrained-path, moving-target search problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883164)