论文标题
基于提示的搜索策略中的平均搜索时间绑定
Average search time bound in cue based search strategy
论文作者
论文摘要
在这项工作中，我们考虑了利用搜索过程中收集的过去信息的搜索问题，以评估每个步骤中查找源的概率分布。我们从样本策略开始，每个步骤的运动都朝着邻域的直接方向，其概率与以当前位置源查找概率的概率的标准化差异成正比。我们评估了此策略的平均搜索时间的下限。接下来，我们将考虑搜索者在任何瞬间评估的概率分布信息的任何策略中的下部问题。我们得出相同的表达式。最后，在粒子通过源均匀扩散的情况下，我们提出了该下限的分析表达。对于具有熵-E的一般概率分布，我们发现下限为EXP（E/2）。
In this work we consider the problem of searches that utilises past information gathered during searching, to evaluate the probability distribution of finding the source at each step. We start with a sample strategy where the movement at each step is in the immediate neighbourhood direction, with a probability proportional to the normalised difference in probability of finding the source with the present position source finding probability. We evaluate a lower bound for the average search time for this strategy . We next consider the problem of the lowerbound on any strategy that utilities information of the probability distribution evaluated by the searcher at any instant. We derive an expression for the same. Finally we present an analytic expression for this lower bound in the case of homogeneous diffusion of particles by a source. For a general probability distribution with entropy-E, we find that the lower bound goes as exp(E/2).
