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

环上静默机器人的最优分散

Optimal Dispersion of Silent Robots in a Ring

Bibhuti Das, Barun Gorain, Kaushik Mondal, Krishnendu Mukhopadhyaya, Supantha Pandit

AI总结:

本文研究环网络中静默机器人的分散问题,针对多源出发场景提出一种确定性分布式算法,在O(log L+k)轮内完成分散且每机器人仅需O(log L)比特内存,并证明该时间下界为Ω(log L+k),从而确立算法最优性。

摘要:

给定一组位于未知匿名图中同一节点的移动机器人,这些机器人必须重新安置到不同的图节点以解决分散问题。本文考虑静默机器人的分散问题,即在有向的n节点环网络中,任意两个位于节点上的机器人之间不存在直接、显式的通信。机器人在同步轮次中运行。静默移动机器人的分散问题已在机器人从单一源点出发的任意图中得到研究。本文关注静默移动机器人可从多个源点出发的分散问题。机器人具有来自区间[0, L]的唯一标签,其中L为某个正整数。任意两个同地机器人不知道对方机器人的标签信息。机器人具有弱多重性检测能力,即它们能够判断自己在某个节点上是否独自存在。假设机器人能够识别在某一特定轮次中节点上机器人数量的增加或减少。然而,机器人无法获知机器人数量增加或减少的精确数值。我们提出了一种确定性的分布式算法,该算法在O(log L+k)个同步轮次内解决k个机器人在有向环中的分散问题,且每个机器人仅需O(log L)比特的内存。文中还给出了k个机器人在环网络上分散所需时间的下界Ω(log L+k),以证明所提算法的最优性。

英文摘要:

Given a set of co-located mobile robots in an unknown anonymous graph, the robots must relocate themselves in distinct graph nodes to solve the dispersion problem. In this paper, we consider the dispersion problem for silent robots \cite{gorain2024collaborative}, i.e., no direct, explicit communication between any two robots placed in the nodes of an oriented $n$ node ring network. The robots operate in synchronous rounds. The dispersion problem for silent mobile robots has been studied in arbitrary graphs where the robots start from a single source. In this paper, we focus on the dispersion problem for silent mobile robots where robots can start from multiple sources. The robots have unique labels from a range $[0,\;L]$ for some positive integer $L$. Any two co-located robots do not have the information about the label of the other robot. The robots have weak multiplicity detection capability, which means they can determine if it is alone on a node. The robots are assumed to be able to identify an increase or decrease in the number of robots present on a node in a particular round. However, the robots can not get the exact number of increase or decrease in the number of robots. We have proposed a deterministic distributed algorithm that solves the dispersion of $k$ robots in an oriented ring in $O(\log L+k)$ synchronous rounds with $O(\log L)$ bits of memory for each robot. A lower bound $Ω(\log L+k)$ on time for the dispersion of $k$ robots on a ring network is presented to establish the optimality of the proposed algorithm.

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

↑