2017/10/25 by Arijit Sil, Sil, Arijit, Sruti Gan Chaudhuri +1
Computer Science · Engineering · Materials Science · #Distributed #FOS: Computer and information sciences #Modular Robots and Swarm Intelligence #Optimization and Search Problems #Parallel #Pickering emulsions and particle stabilization #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1710.09398
openalex publication_date 2017/10/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper proposes a distributed algorithm for a set of tiny unit disc shaped robot to form a straight line. The robots are homoge- neous, autonomous, anonymous. They observe their surrounding up to a certain distance, compute destinations to move to and move there. They do not have any explicit message sending or receiving capability. They forget their past observed or computed data. The robots do not have any global coordinate system or origin. Each robot considers its position as its origin. However, they agree on the X and Y axis. The robots are not aware of the total number of robots in the system. The algorithm presented in this paper assures collision free movements of the robots. To the best of our knowledge this paper is the first reported result on line formation by fat robots under limited visibility.