Fast and efficient formation flocking for a group of autonomous mobile robots

Abstract

The control and coordination of mobile robots in groups that can freely cooperate and move on a plane is a widely studied topic in distributed robotics. In this paper, we focus on the flocking problem: there are two kinds of robots: the leader robot and the follower robots. The follower robots are required to follow the leader robot wherever it goes (following), while keeping a formation they are given in input (flocking). A novel scheme is proposed based on the relative motion theory. Extensive theoretical analysis and simulation results demonstrate that this scheme provides the follower robots an efficient method to follow the leader as soon as possible with the shortest path. Furthermore, this scheme is scalable, and the processing load for every robot is not increased with the addition of more robots.