Gathering Asynchronous Transparent Fat Robots
Gathering of multiple robots is a well known and challenging research problem. Most of the existing works consider the robot to be dimensionless (point). Algorithm for Gatheringfat robots (unit disc robots) has been reported for 3 and 4 robots. This paper proposes a distributed algorithm for Gatheringn (n ≥ 5) autonomous, oblivious, homogeneous, asynchronous, fat robots. The robots are assumed to be transparent and they have full visibility.
KeywordsAsynchronous Fat Robots Gathering
Unable to display preview. Download preview PDF.