arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.01458cs.DMcs.DCmath.CO
收藏

局部网格的分布式搜索

Distributed Searching of Partial Grids

Dariusz Dereniowski, Dorota Urbańska

摘要:

我们考虑下面的分布式追逃问题。一组称为搜索器的移动代理从未知$n$节点网络的任意节点开始。他们的目标是执行一个搜索策略,保证捕获一个快速和无形的入侵者,无论其运动使用尽可能少的代理。我们将注意力限制在嵌入部分网格的网络上:节点被放置在整数坐标的平面上,只有距离为1的节点可以相邻。我们给出了一个分布式算法的搜索,使他们能够计算一个连接和单调的策略,保证搜索任何未知的部分网格与使用$O(\sqrt{n})$搜索。对于一个下界,不仅存在部分网格,需要$Ω(\sqrt{n})$搜索,但我们证明,对于每个分布式搜索算法有一个部分网格,迫使算法使用$Ω(\sqrt{n})$搜索,但$O(\log n)$搜索是足够的离线场景。这给出了$Ω(\sqrt{n}/\log n)$在任何分布式算法的可实现的竞争比方面的下界。

英文摘要:

We consider the following distributed pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown $n$-node network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few agents as possible. We restrict our attention to networks that are embedded into partial grids: nodes are placed on the plane at integer coordinates and only nodes at distance one can be adjacent. We give a distributed algorithm for the searchers that allow them to compute a connected and monotone strategy that guarantees searching any unknown partial grid with the use of $O(\sqrt{n})$ searchers. As for a lower bound, not only there exist partial grids that require $Ω(\sqrt{n})$ searchers, but we prove that for each distributed searching algorithm there is a partial grid that forces the algorithm to use $Ω(\sqrt{n})$ searchers but $O(\log n)$ searchers are sufficient in the offline scenario. This gives a lower bound of $Ω(\sqrt{n}/\log n)$ in terms of achievable competitive ratio of any distributed algorithm.

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

↑