Abstract
In our Paper, we study the problem of how utilizing robots in an algorithm to protect the environment for n luminous robots when there is light provided with every robot. In this problem, we have to keep the robots visible to each other eventually without overlapping or colliding with each other while the robots moving to the environment circumference when they move to their final locations. The robots use Look, Compute, Move (LCM) modes. The robots are supposed the unobstructed vision in their solution meaning that three robots can see each other if they are on the same segment. They are also supposed rigid movements without adversary stopping them.
The robots use lights to choose a color from the color set to indicate in which phase they are because except lights the robots are oblivious, and there is no information about each other, so they only can recognize the lights of each other to solve the problem. In our case, we use only two lights in the color set which is optimal since the problem requires at least two lights to get the optimal solution. In the luminous model of robots, the challenge is when the problem is solved using less lights without requiring the entire number of robots n. The algorithm we present requires O(n) rounds as an execution time.