| 摘要: |
| 研究关于N个位置的最优搜索问题.最优搜索问题是研究如何将用于搜索的资源(如时间等)分配到N个位置使得发现目标的概率为最大.以往人们在研究最优搜索问题时总是假设目标的分布函数是已知的,但实际情况往往不是这样.用拉格朗日算子理论来研究目标的分布函数是未知的情况下的最优搜索问题,得出了一系列新的结果,包括分布函数的近似方法和误差估计公式.最后给出了两个例子. |
| 关键词: 最优搜索 判决函数 目标分布 拉格朗日算子 误差估计 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the Visiting Scholar Foundation of Kay Laboratory in University (高等学校重点实验室访问学者基金);the Returned Overseas Student Research Fundation of the Ministry of Education of China (归国留学人员基金) |
|
| Some Results on Optimal Search in Discrete Spaces |
|
ZHU Qing-xin,ZHOU Ming-tian,John Oommen
|
| Abstract: |
| 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. |
| Key words: optimal search detection function target distribution Lagrangian operator error estimate |
