Infoscience

Working paper

# Pattern formation with voluminous processes

When a shoal of small fishes notices a predator, they typically change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. This motivates us to design algorithms with similar properties. In this paper, we study the problem of distributed pattern formation. A set of processes needs to move from a set of initial positions to a set of final positions. The processes are oblivious (no internal memory) and must preserve, at any time, a minimal distance between them. A naive solution would be to move the processes one by one, but this would have a poor time complexity. The difficulty here is to move the processes simultaneously in clearly delimited phases (as there is no internal memory), no matter how unfavorable the initial configuration may be. We solve this by treating the problem dimension by dimension'': the processes first form 1D trails, then gather into a 2D shape (this technique can be generalized to higher dimensions). We present an optimal algorithm which time complexity depends linearly on the radius of the smallest circle containing both initial and final positions. The algorithm is self-stabilizing, as the processes are oblivious and the initial positions are arbitrary.

#### Reference

• EPFL-WORKING-217547

Record created on 2016-03-29, modified on 2016-08-09