Authors: Deepanwita Das and Srabani Mukhopadhyaya
This paper presents a distributed algorithm for painting a priori known rectangular region by swarm of mobile robots. We assume that there is no obstacle inside the region. Our approach is to divide the region into some cells, and to let each robot to paint one of these cells, assigned to it. Assignment of different cells is done by ranking the robots according to their relative positions. In this algorithm, the robots follow the basic Wait-Observe-Compute-Move model together with the Asynchronous timing model.
Keywords: distributed coverage; robot swarm; painting.