Path optimization for the resource-constrained searcher

DOI10.1002/NAV.20411MaRDI QIDQ3580160zbMATH OpenOpenAlexFDO

Authors Hiroyuki Sato, Johannes O. Royset

Publication date 11 August 2010

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.20411

zbMATH Keywords

branch-and-bound algorithmmilitary applicationssearch theory

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Search theory (90B40) Case-oriented studies in operations research (90B90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Using multiple searchers in constrained-path, moving-target search problems
• PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
• Route optimization for multiple searchers
• The Optimal Search for a Moving Target When the Search Path Is Constrained

Cites work

• Aircraft routing under the risk of detection
• An algorithm for the resource constrained shortest path problem
• 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
• scientific article; zbMATH DE number 3637580 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems
• Near-shortest and K-shortest simple paths
• On finding minimum routes in a network with turn penalties
• Search for a Moving Target: The FAB Algorithm
• Searching for the Multiplier in One-Constraint Optimization Problems
• Shortest chain subject to side constraints
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Using multiple searchers in constrained-path, moving-target search problems

Cited in

(20)

• Helicopter search problems, bandwidth and pathwidth
• Heuristic variants of \(\mathrm{A}^*\) search for 3D flight planning
• Trajectory optimization under kinematical constraints for moving target search
• Moving target search optimization -- a literature review
• A pathfinding problem for search trees with unknown edge length
• The eye and the fist: optimizing search and interdiction
• Minimizing the average searching time for an object within a graph
• Ant colony optimization for path planning in search and rescue operations
• Consistent approximation of a nonlinear optimal control problem with uncertain parameters
• Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
• Search-trajectory optimization. I: Formulation and theory
• Route optimization for multiple searchers
• scientific article; zbMATH DE number 437569 (Why is no real title available?)
• scientific article; zbMATH DE number 6672134 (Why is no real title available?)
• Technical note: Trading off quick versus slow actions in optimal search
• The increasing cost tree search for optimal multi-agent pathfinding
• A sequential perspective on searching for static targets
• scientific article; zbMATH DE number 2159379 (Why is no real title available?)
• scientific article; zbMATH DE number 1852131 (Why is no real title available?)
• Following the trail: an analysis of the path constrained trail-based moving target problem

This page was built for publication: Path optimization for the resource-constrained searcher

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