Modeling sequential searches with ancillary target dependencies
Summary: We develop a mathematical modeling approach to evaluate the effectiveness of a Bayesian search for objects in cases where the target exhibits ancillary dependencies. These dependencies occur in situations where there are multiple search passes of the same region, and they represent a change in search probability from that predicted using an assumption of independent scans. This variation from independent scans is typically found in situations of advanced detection processing due to fusion and/or collaboration between searchers. The framework developed is based upon the evaluation of a recursion process over spatial search cells, and the dependencies appear as additive utility components within the recursion. We derive expressions for evaluating this utility and illustrate in detail some specific instantiations of the dependency. Computational examples are provided to demonstrate the capabilities of the method.
- A sequential perspective on searching for static targets
- Sequential search with partial depth
- Modelling sequences using pairwise relational features
- Search-based structured prediction
- Optimal sequential search: A Bayesian approach
- Evolutionary Computation in Combinatorial Optimization
- Sequential Prediction Over Hierarchical Structures
- Sequential search with adaptive intensity
- scientific article; zbMATH DE number 4209901 (Why is no real title available?)
- scientific article; zbMATH DE number 4110447 (Why is no real title available?)
- scientific article; zbMATH DE number 4123516 (Why is no real title available?)
- scientific article; zbMATH DE number 3304505 (Why is no real title available?)
- Optimal Search Density for a Stationary Target Among Stationary False Targets
- Optimal Search with Uncertain Sweep Width
- Receding horizon recursive state estimation
- SEARCH MODELS WITH CONTINUOUS EFFORT UNDER VARIOUS CRITERIA
- Sequential Search for an Unknown Number of Objects of Nonuniform Size
- Studies on the optimal search plan
- Technical Note—The Complexity of the Optimal Searcher Path Problem
This page was built for publication: Modeling sequential searches with ancillary target dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965877)