arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.09207cs.DC
收藏

三维欧氏空间中同步移动机器人的模式形成问题

Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space

Yukiko Yamauchi, Taichi Uehara, Masafumi Yamashita

摘要:

我们考虑一群自主移动机器人,每个机器人都是三维欧氏空间(3D空间)中的一个匿名点,并同步执行一个共同的分布式算法。我们调查的图案形成问题,需要的机器人形成一个给定的目标图案从一个初始配置和特征的问题,显示机器人形成一个给定的目标图案的充分必要条件。Suzuki和Yamashita(SICOMP 1999,TCS 2010)以及Fujinaga等人(SICOMP 2015)研究了二维的欧几里得空间(2D空间)中的图案形成问题。配置的可扩展性$ρ(P)$(即,机器人的位置)$P$直观上是作用于$P$的循环群的阶。它已被证明,完全同步(FSYNC)的机器人可以形成一个目标模式$F$从初始配置$P$当且仅当$ρ(P)$除$ρ(F)$。我们通过使用旋转群,其中每个旋转群由一组旋转轴及其排列定义,将双折射性的概念扩展到3D空间。我们定义三维空间中构型$P$的旋转度$\varrho(P)$为作用在$P$上且其旋转轴不包含任何机器人的旋转群的集合。我们证明了以下的充分必要条件的图案形成问题,这是一个自然的扩展现有的结果在二维空间中的图案形成问题:FSYNC机器人在三维空间中可以形成一个目标图案$F$从初始配置$P$当且仅当$\varrho(P) \subseteq \varrho(F)$。对于可解的情况,我们提出了一个模式形成算法不经意的FSYNC机器人。本文的见解是,移动机器人在三维空间中的对称性有时低于他们的位置的对称性,机器人可以通过他们的运动来显示他们的对称性。

英文摘要:

We consider a swarm of autonomous mobile robots each of which is an anonymous point in the three-dimensional Euclidean space (3D-space) and synchronously executes a common distributed algorithm. We investigate the pattern formation problem that requires the robots to form a given target pattern from an initial configuration and characterize the problem by showing a necessary and sufficient condition for the robots to form a given target pattern. The pattern formation problem in the two dimensional Euclidean space (2D-space) has been investigated by Suzuki and Yamashita (SICOMP 1999, TCS 2010), and Fujinaga et al. (SICOMP 2015). The symmetricity $ρ(P)$ of a configuration (i.e., the positions of robots) $P$ is intuitively the order of the cyclic group that acts on $P$. It has been shown that fully-synchronous (FSYNC) robots can form a target pattern $F$ from an initial configuration $P$ if and only if $ρ(P)$ divides $ρ(F)$. We extend the notion of symmetricity to 3D-space by using the rotation groups each of which is defined by a set of rotation axes and their arrangement. We define the symmetricity $\varrho(P)$ of configuration $P$ in 3D-space as the set of rotation groups that acts on $P$ and whose rotation axes do not contain any robot. We show the following necessary and sufficient condition for the pattern formation problem which is a natural extension of the existing results of the pattern formation problem in 2D-space: FSYNC robots in 3D-space can form a target pattern $F$ from an initial configuration $P$ if and only if $\varrho(P) \subseteq \varrho(F)$. For solvable instances, we present a pattern formation algorithm for oblivious FSYNC robots. The insight of this paper is that symmetry of mobile robots in 3D-space is sometimes lower than the symmetry of their positions and the robots can show their symmetry by their movement.

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

↑