Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments

-----------------------------------------------------------------------------------------------
This is a summary of the Article “Algorithms for Rapidly Dispersing Robot
Swarms in Unknown Environments”
Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, S´andor P. Fekete, and Joseph S. B. Mitchell

-----------------------------------------------------------------------------------------------
This paper discusses two major issues in swarm robotics, First dispersion algorithms where the robot swarm fills an environment as fast as possible. Dispersion algorithms are mainly based on two different strategies, greedy strategies and artificial physics strategies. The main concentration in the article is about Follow the Leader strategies; it discusses the work done by the writes and the results. Also it covers many different Leader-Follower algorithms.
The research was done in a simulation environment; the robots will come out of a door or more than one. Dispersion strategies for a single door such as Dept-First Leader-Follower and Breadth-First Leader-Follower were discussed in depth and compared. Also, Dispersion strategies with multiple door such Laminar Flow Lead-Follower and many different others were discussed in this paper.
This paper was very helpful in understanding the general concept of the Leader-Follower algorithms. After reading this paper I feel like I can create my own algorithm to fit the purpose of my research.

Time : 6.5 hrs