论文标题
在无限网格上通过异步不透明机器人形成任意图案
Arbitrary pattern formation by asynchronous opaque robots on infinite grid
论文作者
论文摘要
许多文献在不同条件和环境下，许多文献研究了移动机器人的任意模式形成（$ \ MATHCAL {APF} $）。最近，它在无限网络上进行了研究，但具有全面的可见性。在不透明的机器人模型中，还研究了无限网格上的圆形形成。在本文中，我们正在使用带有灯光的异步不透明机器人在无限网格上求解$ \ Mathcal {apf} $。机器人不共享任何全球坐标系统。这个问题的主要挑战是选举一名领导者，同意在其他机器人阻碍机器人愿景的全球协调方面。由于机器人在网格上，因此它们的运动也限制为避免碰撞。在本文中，克服了上述硬度，以产生解决该问题的算法。
Arbitrary pattern formation ($\mathcal{APF}$) by mobile robots is studied by many in literature under different conditions and environment. Recently it has been studied on an infinite grid network but with full visibility. In opaque robot model, circle formation on infinite grid has also been studied. In this paper, we are solving $\mathcal{APF}$ on infinite grid with asynchronous opaque robots with lights. The robots do not share any global co-ordinate system. The main challenge in this problem is to elect a leader to agree upon a global co-ordinate where the vision of the robots are obstructed by other robots. Since the robots are on a grid, their movements are also restricted to avoid collisions. In this paper, the aforementioned hardness are overcome to produce an algorithm that solves the problem.
