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

DOI10.1016/J.EJOR.2007.10.048MaRDI QIDQ958076zbMATH OpenOpenAlexFDO

Authors 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

heuristicsnetwork flowsMarkov processessearch theory

Mathematics Subject Classification ID

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

Recommendations

• An exact iterative search algorithm for constrained Markov decision processes
• A policy iteration heuristic for constrained discounted controlled Markov chains
• The optimal search for a Markovian target when the search path is constrained: the infinite-horizon case
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
• Publication:3469031
• Random search for constrained Markov decision processes with multi-policy improvement
• An Heuristic for Multi-Dimensional Markov Decision Processes
• Criteria and approximate methods for path-constrained moving-target search problems
• Heuristic algorithm for nested Markov decision process: solution quality and computational complexity

Cites work

• scientific article; zbMATH DE number 420886 (Why is no real title available?)
• scientific article; zbMATH DE number 4209901 (Why is no real title available?)
• A Simple Model of Search for a Moving Target
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
• Criteria and approximate methods for path-constrained moving-target search problems
• Detection of a Markovian target with optimization of the search efforts under generalized linear constraints
• Optimal Search for a Moving Target in Discrete Time and Space
• Optimal strategy of route and look for the path constrained search problem with reward criterion
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• The Optimal Search for a Moving Target When the Search Path Is Constrained
• The optimal search for a Markovian target when the search path is constrained: the infinite-horizon case
• Using multiple searchers in constrained-path, moving-target search problems

Cited in

(5)

• Moving target search optimization -- a literature review
• 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
• On maximum discounted effort reward search problem
• Existence of tracking Brownian nanoparticle technique with reducing its first collision time with one of the nanosensors in the interactive medium

This page was built for publication: A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search

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