Optimal discrete search with imperfect specificity
From MaRDI portal
Publication:999129
DOI10.1007/s00186-007-0197-2zbMath1155.90009OpenAlexW2025526343MaRDI QIDQ999129
Kyle Y. Lin, Moshe Kress, Roberto Szechtman
Publication date: 30 January 2009
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-007-0197-2
Related Items
Scheduling an autonomous robot searching for hidden targets ⋮ Technical Note—Trading Off Quick versus Slow Actions in Optimal Search ⋮ The eye and the fist: optimizing search and interdiction ⋮ When Is Information Sufficient for Action? Search with Unreliable yet Informative Intelligence ⋮ Finding a hider by an unknown deadline ⋮ Unnamed Item ⋮ Exact and heuristic approaches to detect failures in failed \(k\)-out-of-\(n\) systems ⋮ Optimal discrete search with technological choice
Cites Work
- Unnamed Item
- Discrete search with multiple sensors
- Optimal search with positive switch cost is NP-hard
- Theory of optimal search
- The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities
- A Periodic Optimal Search
- A Theory of Reconnaissance: I
- A Sequential Search Procedure
- Search Detection and Subsequent Action: Some Problems on the Interfaces
- Optimal Whereabouts Search
- Optimal Stopping in a Discrete Search Problem
