arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1812.05352cs.DCcs.DS
收藏

移动机器人在任意图和网格上的有效散布

Efficient Dispersion of Mobile Robots on Arbitrary Graphs and Grids

Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma

摘要:

图上的移动机器人分散问题要求最初任意放置在$n$-节点匿名图的节点上的$k\leq n$机器人自主地重新定位以达到每个机器人在图的不同节点上的配置。这个问题是显着的兴趣,由于其关系到其他基本的机器人协调问题,如勘探,分散,负载平衡,并重新定位的自驱动电动汽车(机器人)充电站(节点)。在本文中,我们提供了两种新的确定性算法的分散,一个任意图形和另一个网格图,在一个同步设置,所有机器人在每个时间步执行他们的行动。我们的算法为任意图形有$O(\min(m,kΔ) \cdot \log k)$步骤运行时使用$O(\log n)$位的内存在每个机器人,其中$m$是边缘的数量和$Δ$是最大程度的图形。这是对$O(mk)$步骤的指数改进,这是先前已知的最佳算法。特别是,我们的算法的运行时间是最佳的(高达$O(\log k)$因素)在常数度任意图。我们的算法网格图有$O(\min(k,\sqrt{n}))$步骤运行时使用$Θ(\log k)$位在每个机器人。这是第一个算法分散在网格图。此外,该算法是最佳的内存和时间时,$k=Ω(n)$。

英文摘要:

The mobile robot dispersion problem on graphs asks $k\leq n$ robots placed initially arbitrarily on the nodes of an $n$-node anonymous graph to reposition autonomously to reach a configuration in which each robot is on a distinct node of the graph. This problem is of significant interest due to its relationship to other fundamental robot coordination problems, such as exploration, scattering, load balancing, and relocation of self-driven electric cars (robots) to recharge stations (nodes). In this paper, we provide two novel deterministic algorithms for dispersion, one for arbitrary graphs and another for grid graphs, in a synchronous setting where all robots perform their actions in every time step. Our algorithm for arbitrary graphs has $O(\min(m,kΔ) \cdot \log k)$ steps runtime using $O(\log n)$ bits of memory at each robot, where $m$ is the number of edges and $Δ$ is the maximum degree of the graph. This is an exponential improvement over the $O(mk)$ steps best previously known algorithm. In particular, the runtime of our algorithm is optimal (up to a $O(\log k)$ factor) in constant-degree arbitrary graphs. Our algorithm for grid graphs has $O(\min(k,\sqrt{n}))$ steps runtime using $Θ(\log k)$ bits at each robot. This is the first algorithm for dispersion in grid graphs. Moreover, this algorithm is optimal for both memory and time when $k=Ω(n)$.

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

↑