Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space
We consider the plane formation problem that requires a set of autonomous mobile robots initially placed in the three-dimensional space to land on a common plane that is not defined a priori. The problem was first introduced for fully-synchronous (FSYNC) robots with rigid movement (i.e., the robots always reach the next position) and solvable instances are characterized in terms of the symmetry among the robots, i.e., the rotation group of the initial configuration of robots (Yamauchi et al. DISC 2015). We consider the plane formation problem for semi-synchronous (SSYNC) robots with non-rigid movement. We present a plane formation algorithm for oblivious SSYNC robots, and show that the SSYNC robots with non-rigid movement have the same plane formation power as the FSYNC robots with rigid movement.
KeywordsMobile robots The plane formation problem Semi-synchronous model Non-rigid movement Symmetry breaking
- 5.Flocchini, P., Prencipe, G., Santoro, N., Viglietta, G.: Distributed computing by mobile robots: Solving the uniform circle formation problem. In: Proceedings OPODIS 2014, pp. 217–232 (2014)Google Scholar
- 11.Yamauchi, Y., Uehara, T., Yamashita, M.: Brief announcement: pattern formation problem for synchronous mobile robots in the three dimensional euclidean space. In: Proceedings of PODC 2016, pp. 447–449 (2016)Google Scholar