Optimal search-relocation trade-off in Markovian-target searching
DOI10.1016/J.COR.2008.07.007zbMATH Open1179.90050OpenAlexW2002939362MaRDI QIDQ1001004FDOQ1001004
Authors: Sung-Pil Hong, Myoung-Ju Park, Moon-Gul Lee, 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
Recommendations
- scientific article; zbMATH DE number 4214806
- scientific article; zbMATH DE number 3968305
- The optimal search for a Markovian target when the search path is constrained: the infinite-horizon case
- Optimal searching for a randomly located target in a bounded known region
- The Optimal Search for a Moving Target When the Search Path Is Constrained
- Optimal search for a moving target with the option to wait
- Optimal search for moving objects in a discrete domain
- Publication:3469031
- scientific article; zbMATH DE number 4087410
- Optimal search for a moving target
Deterministic network models in operations research (90B10) Search theory (90B40) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- The Optimal Search for a Moving Target When the Search Path Is Constrained
- Title not available (Why is that?)
- Using multiple searchers in constrained-path, moving-target search problems
- Technical Note—The Complexity of the Optimal Searcher Path Problem
- A Simple Model of Search for a Moving Target
- 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
- Optimal strategy of route and look for the path constrained search problem with reward criterion
- An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
- Title not available (Why is that?)
Cited In (11)
- Optimal Markov monotone symmetric random search
- Moving target search optimization -- a literature review
- Stability of the optimal distribution for the searching effort to find the Markovian targets by using fuzzy maximum discounted effort reward search: case of the cooperative search techniques
- Optimal linear tracking for a hidden target on one of \(K\)-intervals
- The searching algorithm for detecting a Markovian target based on maximizing the discounted effort reward search
- Technical note: Trading off quick versus slow actions in optimal search
- Optimal parameters for search using a barrier tree Markov model
- On maximum discounted effort reward search problem
- AN OPTIMAL DISTRIBUTION OF SEARCHING EFFORT RELAXING THE ASSUMPTION OF LOCAL EFFECTIVENESS
- Trajectory optimization under kinematical constraints for moving target search
- Optimal searching for a Helix target motion
This page was built for publication: Optimal search-relocation trade-off in Markovian-target searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1001004)
