Optimal search-relocation trade-off in Markovian-target searching

DOI10.1016/J.COR.2008.07.007zbMath1179.90050OpenAlexW2002939362MaRDI QIDQ1001004

Sung-Pil Hong, Moon-Gul Lee, Myoung-Ju Park, Sung Jin Cho

Publication date: 12 February 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.07.007

zbMATH Keywords

optimizationprobabilitysearchnetworks and graphs

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Search theory (90B40) Deterministic network models in operations research (90B10)

Related Items (6)

On Maximum Discounted Effort Reward Search Problem ⋮ Trajectory optimization under kinematical constraints for moving target search ⋮ The searching algorithm for detecting a Markovian target based on maximizing the discounted effort reward search ⋮ Optimal linear tracking for a hidden target on one of \(K\)-intervals ⋮ Moving target search optimization -- a literature review ⋮ Optimal searching for a Helix target motion

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal strategy of route and look for the path constrained search problem with reward criterion
• The Optimal Search for a Moving Target When the Search Path Is Constrained
• Optimal Search for a Moving Target in Discrete Time and Space
• Detection of a Markovian target with optimization of the search efforts under generalized linear constraints
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Using multiple searchers in constrained-path, moving-target search problems
• A Simple Model of Search for a Moving Target
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

This page was built for publication: Optimal search-relocation trade-off in Markovian-target searching