Search Path Evaluation Incorporating Object Placement Structure.

摘要

This report describes a computationally robust approach to search path performance evaluation where the objects of search interest exhibit structure in the way in which they occur within the search space. The report describes the undenying theoretical probability basis for the search evaluation computations, and provides specific details about the implementation of the numerical method. While the method is general for searchers looking for objects with structured placement, specific examples are given that are drawn from a mine hunting application. In these examples, the object structures to be examined are the laying of mines. In specific mine field patterns, and the performance criterion under evaluation is search effectiveness and its relation to object clearance. Numerical issues such as the discretization of space, the detail of representation, and the scalability of computation are discussed. The application of this theoretical foundation and the numerical methods to other search paradigms is also discussed.