arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1205.2170cs.DCcs.DM
收藏

在没有通信的情况下在飞机上进行协同搜索

Collaborative search on the plane without communication

Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sébastien Sereni

摘要:

我们将经典的奶牛路径问题[7,14,38,39]推广到一个与动物群体集体觅食相关的问题。具体来说,我们考虑一个设置中,k相同的(概率)代理,最初放置在一些中心位置,集体寻找一个宝藏在二维平面。宝藏被对手放置在目标位置,目标是尽可能快地找到它,作为k和D的函数,其中D是中心位置和目标之间的距离。这是生物学上的动机,合作,中央位置觅食,如蚂蚁周围的巢穴。在这种类型的搜索中,有一种强烈的偏好,即在那些更远的食物来源之前找到附近的食物来源。我们的重点是试图找到什么可以实现,如果沟通是有限的或完全没有。事实上,为了避免重叠,代理人必须高度分散,使沟通困难。此外,如果代理不同步开始搜索,那么即使是初始通信也是有问题的。这尤其适用于主体是否能够通信并推断出它们的总数k的问题。事实证明,每个代理人对k的了解对性能至关重要。事实上,这是一个简单的观察,发现宝藏所需的时间是$Ω$(D + D 2 /k),在本文中,我们表明,这个界限可以匹配,如果代理人有知识的k到一些常数近似。我们提出了一个几乎紧界的竞争惩罚,必须支付,在运行时间,如果代理人没有关于k的信息。具体来说,在消极的一面,我们表明,在这种情况下,没有算法的竞争力是O(log k)。另一方面,我们表明,对于每一个常数$ε\textgreater{} 0$,存在一个相当简单的均匀搜索算法是$O( \log^{1+ε} k)$ -竞争。此外,我们给出了一个下界的设置,其中代理人被赋予一些估计的k。作为一种特殊情况,这个下限意味着对于任何常数$ε\textgreater{} 0$,如果每个代理被给予一个(单侧)$k^ε$ -近似k,那么竞争性是$Ω$(log k)。非正式地,我们的结果意味着,代理可以潜在地表现良好,而无需知道他们的总数k,然而,为了进一步改进,他们必须给出一个相对较好的近似k。最后,我们提出了一个统一的算法,这是有效的和非常简单的建议其相关性的实际生物场景。

英文摘要:

We generalize the classical cow-path problem [7, 14, 38, 39] into a question that is relevant for collective foraging in animal groups. Specifically, we consider a setting in which k identical (probabilistic) agents, initially placed at some central location, collectively search for a treasure in the two-dimensional plane. 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 distance between the central location and the target. This is biologically motivated by cooperative, central place foraging such as performed by ants around their nest. In this type of search there is a strong preference to locate nearby food sources before those that are further away. Our focus is on trying to find what can be achieved if communication is limited or altogether absent. Indeed, to avoid overlaps agents must be highly dispersed making communication difficult. Furthermore, if agents do not commence the search in synchrony then even initial communication is problematic. This holds, in particular, with respect to the question of whether the agents can communicate and conclude their total number, k. It turns out that the knowledge of k by the individual agents is crucial for performance. Indeed, it is a straightforward observation that the time required for finding the treasure is $Ω$(D + D 2 /k), and we show in this paper that this bound can be matched if the agents have knowledge of k up to some constant approximation. We present an almost tight bound for the competitive penalty that must be paid, in the running time, if agents have no information about k. Specifically, on the negative side, we show that in such a case, there is no algorithm whose competitiveness is O(log k). On the other hand, we show that for every constant $ε\textgreater{} 0$, there exists a rather simple uniform search algorithm which is $O( \log^{1+ε} k)$-competitive. In addition, we give a lower bound for the setting in which agents are given some estimation of k. As a special case, this lower bound implies that for any constant $ε\textgreater{} 0$, if each agent is given a (one-sided) $k^ε$-approximation to k, then the competitiveness is $Ω$(log k). Informally, our results imply that the agents can potentially perform well without any knowledge of their total number k, however, to further improve, they must be given a relatively good approximation of k. Finally, we propose a uniform algorithm that is both efficient and extremely simple suggesting its relevance for actual biological scenarios.

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

↑