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

广度优先深度下一个:低直径树的最优协作探索

Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter

Romain Cosson, Laurent Massoulié, Laurent Viennot

摘要:

我们认为,由Fraigniaud,Gasieniec,Kowalski,和Pelc的$k$代理团队的任务是集体尽可能快地通过一个未知的树的所有边缘的协作树探索的问题。Fraigniaud等人的$\mathcal{O}(n/\log(k)+D)$算法用$n$表示节点的总数,用$D$表示树的深度,实现了关于离线探索成本的最著名的竞争比,即$Θ(\max{\{2n/k,2D\}})$。Brass、Cabrera-Mora、Gasparri和Xiao考虑了另一种性能标准,即相对于$2n/k$的附加开销,并获得了$2n/k+\mathcal{O}((D+k)^k)$运行时保证。在本文中,我们介绍了“广度优先深度下一个”(BFDN),一种新颖而简单的算法,执行协作树探索的时间$2n/k+\mathcal{O}(D^2\log(k))$,从而优于黄铜等。所有值的$(n,D)$和顺序最优的深度$D=o_k(\sqrt{n})$的所有树。此外,Disser等人最近的结果表明,没有探索算法可以实现$2n/k+\mathcal{O}(D^{2-ε})$运行时保证。在$D^2$中,我们的界的依赖性在这个意义上是最优的。我们的结果的证明关键依赖于一个相关的两人博弈的分析。我们将BFDN的保证扩展到:内存和通信有限的场景,可以阻止机器人的对抗设置,以及探索非树图类。最后,我们提供了一个递归版本的BFDN与运行时的$\mathcal{O}_\ell(n/k^{1/\ell}+\log(k) D^{1+1/\ell})$参数$\ell\ge 1$,从而提高性能的树与大深度。

英文摘要:

We consider the problem of collaborative tree exploration posed by Fraigniaud, Gasieniec, Kowalski, and Pelc where a team of $k$ agents is tasked to collectively go through all the edges of an unknown tree as fast as possible. Denoting by $n$ the total number of nodes and by $D$ the tree depth, the $\mathcal{O}(n/\log(k)+D)$ algorithm of Fraigniaud et al. achieves the best-known competitive ratio with respect to the cost of offline exploration which is $Θ(\max{\{2n/k,2D\}})$. Brass, Cabrera-Mora, Gasparri, and Xiao consider an alternative performance criterion, namely the additive overhead with respect to $2n/k$, and obtain a $2n/k+\mathcal{O}((D+k)^k)$ runtime guarantee. In this paper, we introduce `Breadth-First Depth-Next' (BFDN), a novel and simple algorithm that performs collaborative tree exploration in time $2n/k+\mathcal{O}(D^2\log(k))$, thus outperforming Brass et al. for all values of $(n,D)$ and being order-optimal for all trees with depth $D=o_k(\sqrt{n})$. Moreover, a recent result from Disser et al. implies that no exploration algorithm can achieve a $2n/k+\mathcal{O}(D^{2-ε})$ runtime guarantee. The dependency in $D^2$ of our bound is in this sense optimal. The proof of our result crucially relies on the analysis of an associated two-player game. We extend the guarantees of BFDN to: scenarios with limited memory and communication, adversarial setups where robots can be blocked, and exploration of classes of non-tree graphs. Finally, we provide a recursive version of BFDN with a runtime of $\mathcal{O}_\ell(n/k^{1/\ell}+\log(k) D^{1+1/\ell})$ for parameter $\ell\ge 1$, thereby improving performance for trees with large depth.

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

↑