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.
An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous Robots on Grids
Graduate School of Advanced Science and Engineering, Hiroshima University(广岛大学先进理工学研究科);Sorbonne University, CNRS, LIP6, Institut Universitaire de France(索邦大学、法国国家科学研究中心、LIP6实验室、法国大学研究所)
Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach
给定欧氏平面上任意多点集F和机器人集R,使得|R| = |F|,任意模式形成(APF)问题要求一个分布式算法,移动机器人,以达到类似于F的配置。相似性意味着机器人必须被配置为F,而不管平移、旋转、反射、均匀缩放。最初,每个机器人占据不同的位置。当激活时,机器人以标准LCM周期运行。机器人是异步的、不经意的、匿名的、沉默的,并且执行相同的分布式算法。到目前为止,这个问题主要通过假设手征来解决,即机器人有一个共同的左右方向。我们有兴趣取消这种限制。在处理这一问题时,我们面临着需要密切关注的几个问题。我们深入研究了这些困难是如何克服的文献中,揭示了现有算法的正确性证明的关键参数被忽视。系统缺乏严格的参数方面提供正确性证明所需的必要条件,深刻影响的有效性,以及在文献中提出的战略的相关性。在这里,我们设计了一个新的确定性分布式算法,充分表征APF显示其等价性与著名的领导人选举问题的异步模型没有手征。我们的方法的特点是使用逻辑谓词,以正式描述我们的算法以及它的正确性。除了我们的成就的相关性,我们的技术可能有助于修改以前的结果。事实上,结果表明,成熟的结果如[Fujinaga et al,SIAM J. Comp. 44(3)2015],最近的方法如[Bramas et al,PODC and SSS 2016]和“非官方”结果如[Dieudonne et al,arXiv:0902.2851]…
Min-Sum Uniform Coverage Problem by Autonomous Mobile Robots
Department of Mathematics(数学系);Birla Institute of Technology, Mesra(比拉理工学院,梅斯拉);Advanced Computing and Microelectronics Unit, Indian Statistical Institute(印度统计研究所高级计算与微电子单位)