Reconfiguration of robot swarm formation

An algorithm of control and navigation for a swarm of autonomous homogeneous mobile robots involved in the formation of a convex space surface is discussed. Robot trajectories during reconfiguration minimize the cost of time and energy (computation time and the total length of robot paths), taking into account collision control. The developed algorithm has quadratic computational complexity. During the experiments reconfiguration of a swarm with various numbers of robots (from 10 to 10,000 robots) was modeled. The number of collisions was evaluated assuming massed start of all robots.