Some Results on Optimal Search in Discrete Spaces
关于离散空间中最优搜索策略的一些结果

In this paper the searching problem for an object in a set of N locations is considered. The goal is to allocate the resources so as to maximize the probability of locating the object. By using Lagrangian operator method the problem of optimal search with the unknown target distribution is studied. Some selection criteria and error estimate results are derived.