In this paper, we propose a distributed algorithm to uniformly scatter the autonomous mobile robots along a grid, with robots on alternate nodes of this grid distribution. These homogeneous and anonymous robots place themselves equidistant apart on the ...

Arbitrary Pattern Formation is a fundamental robot coordination problem. The problem asks for a distributed algorithm that allows a swarm of autonomous mobile robots to form any pattern given as input. The majority of the works in the literature ...

The gathering over meeting nodes problem requires the mobile robots to gather at one of the pre-defined meeting nodes. The robots are deployed on the nodes of an anonymous two-dimensional infinite grid which has a subset of nodes marked as meeting ...

A solution to the k-circle formation problem requires the formation of disjoint circles by a swarm of mobile robots. The circles are restricted to be centered at one of the pre-fixed points. Each circle must contain exactly k robots at distinct ...