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


We investigate the pattern formation problem that requires a swarm of autonomous mobile robots to form a given target pattern in the three-dimensional Euclidean space. We show a necessary and sufficient condition for synchronous robots to form a given target pattern from an initial configuration. We give a pattern formation algorithm for solvable instances that does not need any local memory at each robot.

DOI: 10.1145/2933057.2933063

Extracted Key Phrases

36 Figures and Tables

Unfortunately, ACM prohibits us from displaying non-influential references for this paper.

To see the full reference list, please visit