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

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199606)43:4<463::AID-NAV1>3.0.CO;2-5" /><463::AID-NAV1>3.0.CO;2-5 10.1002/(SICI)1520-6750(199606)43:4<463::AID-NAV1>3.0.CO;2-5zbMath0846.90060OpenAlexW2049973619MaRDI QIDQ4883164

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

Publication date: 1 July 1996

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199606)43:4<463::aid-nav1>3.0.co;2-5

zbMATH Keywords

heuristicsbranch-and-boundconstrained-path problemsmultiple-searcher, moving-target search problem

Mathematics Subject Classification ID

Search theory (90B40)

Related Items (13)

Scheduling an autonomous robot searching for hidden targets ⋮ Path integration mediated systematic search: a Bayesian model ⋮ Trajectory optimization under kinematical constraints for moving target search ⋮ Aerial vehicle search-path optimization: a novel method for emergency operations ⋮ A Constraint Optimization Approach for the Allocation of Multiple Search Units in Search and Rescue Operations ⋮ Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times ⋮ Solving the moving target search problem using indistinguishable searchers ⋮ Moving target search optimization -- a literature review ⋮ A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search ⋮ Path optimization for the resource-constrained searcher ⋮ Route optimization for multiple searchers ⋮ Optimal search-relocation trade-off in Markovian-target searching ⋮ Performance of a class of multi-robot deploy and search strategies based on centroidal voronoi configurations

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