A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search

DOI10.1016/J.EJOR.2007.10.048zbMath1163.90785OpenAlexW2059567099MaRDI QIDQ958076

Sung-Pil Hong, Myoung-Ju Park, Sung Jin Cho

Publication date: 2 December 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.10.048

zbMATH Keywords

heuristicsMarkov processesnetwork flowssearch theory

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Markov and semi-Markov decision processes (90C40)

Related Items (4)

On Maximum Discounted Effort Reward Search Problem ⋮ 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

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
• Criteria and approximate methods for path-constrained moving-target search problems
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Using multiple searchers in constrained-path, moving-target search problems
• The optimal search for a Markovian target when the search path is constrained: the infinite-horizon case
• 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: A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search