Universal Pattern Formation by Oblivious Robots Under Sequential Schedulers

TL;DR

This paper demonstrates that oblivious robots operating under sequential schedulers can solve complex pattern formation problems, surpassing capabilities under fully synchronous models, with specific conditions for gathering tasks.

Contribution

It proves that universal pattern formation is solvable under sequential schedulers without extra assumptions, contrasting with its impossibility under FSYNC.

Findings

UPF is unsolvable under FSYNC even with strong capabilities.

UPF is solvable under sequential schedulers without additional assumptions, except for point formation.

Weak multiplicity detection is necessary and sufficient for gathering under sequential schedulers.

Abstract

We study the computational power that oblivious robots operating in the plane have under sequential schedulers. We show that this power is much stronger than the obvious capacity these schedulers offer of breaking symmetry, and thus to create a leader. In fact, we prove that under any sequential scheduler, robots are capable of solving problems that are unsolvable even with a leader under the fully synchronous scheduler FSYNC. More precisely, we consider the class of pattern formation problems, and focus on the most general problem in this class, Universal Pattern Formation (UPF), which requires the robots to form every pattern given in input, starting from any initial configuration (where some robots may occupy the same point, hence forming a multiplicity). We first show that UPF is unsolvable under FSYNC, even if the robots are endowed with additional strong capabilities (multiplicity detection, rigid movement, agreement on coordinate systems, presence of a unique leader). On the other hand, we prove that, except for point formation (Gathering), UPF is solvable under any sequential scheduler without any additional assumptions. We then turn our attention to the Gathering problem, and prove that weak multiplicity detection (the ability to detect a multiplicity but not the exact number of robots forming it) is necessary and sufficient for solvability under sequential schedulers. The results obtained show that the computational power of the robots under FSYNC (where Gathering is solvable without any multiplicity detection) and that under sequential schedulers are orthogonal.