Technical note: Trading off quick versus slow actions in optimal search
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7271257
- The Optimal Search for a Moving Target When the Search Path Is Constrained
- Criteria and approximate methods for path-constrained moving-target search problems
- Using multiple searchers in constrained-path, moving-target search problems
- Optimal search-relocation trade-off in Markovian-target searching
Cites work
- A Problem in Optimal Search and Stop
- An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
- Discrete Sequential Search with Positive Switch Cost
- scientific article; zbMATH DE number 4209901 (Why is no real title available?)
- scientific article; zbMATH DE number 6318818 (Why is no real title available?)
- Mining coal or finding terrorists: the expanding search paradigm
- Optimal discrete search with imperfect specificity
- Path optimization for the resource-constrained searcher
- Rendezvous-Evasion Search in Two Boxes
- Searching for an Agent Who May OR May Not Want to be Found
- Technical Note—The Complexity of the Optimal Searcher Path Problem
- The Discrete Sequential Search Problem with Nonrandom Cost and Overlook Probabilities
Cited in
(7)- A search problem on a bipartite network
- Approximate solutions for expanding search games on general networks
- Search Before Trade-offs Are Known
- Exact and heuristic algorithms for risk-aware stochastic physical search
- scientific article; zbMATH DE number 7271257 (Why is no real title available?)
- When is information sufficient for action? search with unreliable yet informative intelligence
- Data-Driven Pathwise Sampling Approaches for Online Anomaly Detection
This page was built for publication: Technical note: Trading off quick versus slow actions in optimal search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453336)
