We consider evacuation from a finite two-dimensional (2D) square grid field by a metamorphic robotic system (MRS). An MRS is composed of anonymous memoryless modules. Each module of an MRS executes an identical distributed algorithm and moves autonomously while keeping the connectivity of modules. Since the modules are memoryless, an MRS utilizes its shape to remember the progress of execution. The number of available shapes that an MRS can form depends on the number of modules, which is thus an important complexity measure for a behavior of an MRS. In this paper, we investigate the minimum number of modules required to solve the evacuation problem with several conditions. First, we consider a rectangular field surrounded by walls with at least one exit and show that two modules are necessary and sufficient for evacuation from any rectangular field if the modules are equipped with a global compass, which allows the modules to have a common sense of direction. Then, we focus on the case where modules do not have a global compass and show that four (resp. seven) modules are necessary and sufficient for restricted (resp. any) initial states of an MRS. We also show that two modules are sufficient in the special case where an MRS is on a wall in an initial configuration. Finally, we extend these results to another type of fields, that is, mazes.
翻译:我们考虑用一个变形机器人系统(MRS)从一个有限的二维(2D)平方格场进行疏散。MRS由匿名的不记忆模块组成。MRS的每个模块在保持模块连接的同时,执行一个相同的分布算法并自动移动。由于模块没有记忆,MRS利用其形状来回忆执行进度。MRS能够形成的可用形状数量取决于模块数量,因此,这是MRS行为的一个重要复杂度量。在本文中,我们用几种条件调查解决疏散问题所需的模块最低数量。首先,我们考虑一个由至少一个出口的墙环绕的矩形字段,并显示如果模块配备了全球指南,两个模块就足够地从任何矩形字段进行疏散,从而使模块具有共同方向感。然后,我们侧重于模块没有全球指南且显示四个(重复的七)模块是必要且足够限制(重复的)MRS初始状态。我们还认为,两个模块对于任何磁盘的初始状态都足够。我们最后显示,两个模块对于从任何矩形场都是必要的,这些磁盘在另一个特殊的字段中,这些磁盘是另一个磁场。