随机协同搜索的记忆下限及其在生物学中的应用
Memory Lower Bounds for Randomized Collaborative Search and Applications to Biology
摘要:
对群体规模的初步了解对集体绩效至关重要。我们研究这种关系的背景下,{ \em蚂蚁附近的宝藏搜索(ANTS)}的问题\cite{FKLS},该模型自然的合作觅食行为,如蚂蚁在他们的巢。在这个问题中,$k$(概率)代理,最初放置在一些中心位置,集体搜索二维网格上的宝藏。宝藏被对手放置在目标位置,目标是尽可能快地找到它,作为$k$和$D$的函数,其中$D$是中心位置和目标之间的(未知)距离。很容易看出,$T=Ω(D+D^2/k)$时间单位对于寻找宝藏是必要的。最近,已经确定,如果代理知道它们的总数$k$(或其常数近似值),并且有足够的存储器位可供它们处置\cite{FKLS},则$O(T)$时间是足够的。在本文中,我们建立了实现一定的运行时间性能所需的代理内存大小的下限。据我们所知,这些界限是第一个非平凡的概率搜索器的内存大小的下限。例如,对于每个给定的正常数$ε$,按时间$O(\log^{1-ε} k \cdot T)$终止搜索要求代理使用$Ω(\log\log k)$存储器位。这样的分布式计算边界可以为复杂生物系统的研究提供一种新的、强有力的工具。
英文摘要:
Initial knowledge regarding group size can be crucial for collective performance. We study this relation in the context of the {\em Ants Nearby Treasure Search (ANTS)} problem \cite{FKLS}, which models natural cooperative foraging behavior such as that performed by ants around their nest. In this problem, $k$ (probabilistic) agents, initially placed at some central location, collectively search for a treasure on the two-dimensional grid. The treasure is placed at a target location by an adversary and the goal is to find it as fast as possible as a function of both $k$ and $D$, where $D$ is the (unknown) distance between the central location and the target. It is easy to see that $T=Ω(D+D^2/k)$ time units are necessary for finding the treasure. Recently, it has been established that $O(T)$ time is sufficient if the agents know their total number $k$ (or a constant approximation of it), and enough memory bits are available at their disposal \cite{FKLS}. In this paper, we establish lower bounds on the agent memory size required for achieving certain running time performances. To the best our knowledge, these bounds are the first non-trivial lower bounds for the memory size of probabilistic searchers. For example, for every given positive constant $ε$, terminating the search by time $O(\log^{1-ε} k \cdot T)$ requires agents to use $Ω(\log\log k)$ memory bits. Such distributed computing bounds may provide a novel, strong tool for the investigation of complex biological systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。