arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.02555cs.DC
收藏

ANTS问题

The ANTS problem

Ofer Feinerman, Amos Korman

摘要:

我们介绍了蚂蚁附近的宝藏搜索(ANTS)问题,该模型自然的合作觅食行为,如蚂蚁在他们的巢。在这个问题中,k个概率代理,最初被放置在一个中心位置,集体搜索二维网格上的宝藏。宝藏被对手放置在目标位置,代理的目标是尽可能快地找到它,作为k和D的函数,其中D是中心位置和目标之间的(未知)距离。我们集中在代理不能沟通,而搜索的情况下。很容易看出,直到至少一个代理找到目标的时间至少是$Ω$(D + D 2 /k),即使对于非常复杂的代理,具有不受限制的内存。我们的算法分析旨在建立时间复杂度和代理持有的初始知识之间的联系(例如,关于它们的总数k),当它们开始搜索时。我们提供了一个范围内的上限和下限为获得快速运行时间所需的初始知识。例如,我们证明了log log k + $Θ$(1)比特的初始信息对于获得渐近最优运行时间是必要且充分的,即,时间复杂度为O(D + D2/k).我们还证明,对于每0 \textless{} \textless{} 1,运行时间O(日志1- k $\times$(D +D 2 /k))要求代理有能力存储$Ω$(日志k)不同的状态,因为他们离开巢开始搜索。据我们所知,本文提出的下界提供了第一个非平凡的搜索问题的背景下,概率代理的内存复杂性的下界。我们认为这篇论文是一种新型的跨学科方法的“概念证明”。为了充分证明这种方法,这里提出的理论权衡(或类似的)应该与搜索蚂蚁的时间性能的测量相结合。

英文摘要:

We introduce the Ants Nearby Treasure Search (ANTS) problem, which models natural cooperative foraging behavior such as that performed by ants around their nest. In this problem, k probabilistic agents, initially placed at a 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 agents' 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. We concentrate on the case in which agents cannot communicate while searching. It is straightforward to see that the time until at least one agent finds the target is at least $Ω$(D + D 2 /k), even for very sophisticated agents, with unrestricted memory. Our algorithmic analysis aims at establishing connections between the time complexity and the initial knowledge held by agents (e.g., regarding their total number k), as they commence the search. We provide a range of both upper and lower bounds for the initial knowledge required for obtaining fast running time. For example, we prove that log log k + $Θ$(1) bits of initial information are both necessary and sufficient to obtain asymptotically optimal running time, i.e., O(D +D 2 /k). We also we prove that for every 0 \textless{} \textless{} 1, running in time O(log 1-- k $\times$(D +D 2 /k)) requires that agents have the capacity for storing $Ω$(log k) different states as they leave the nest to start the search. To the best of our knowledge, the lower bounds presented in this paper provide the first non-trivial lower bounds on the memory complexity of probabilistic agents in the context of search problems. We view this paper as a "proof of concept" for a new type of interdisciplinary methodology. To fully demonstrate this methodology, the theoretical tradeoff presented here (or a similar one) should be combined with measurements of the time performance of searching ants.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑