Distributed anonymous mobile robots: formation of geometric patterns

摘要

Formation problems of geometric patterns in the plane by the robots are studied. Algorithms are given for converging the robots to a single point and moving the robots to a single point in finite steps. In addition, the class of geometric patterns that the robots can form in terms of their initial configuration are also characterized.