Distributed memoryless point convergence algorithm for mobile robots with limited visibility

We present a distributed algorithm for converging autonomous mobile robots with limited visibility toward a single point. Each robot is an omnidirecti onal mobile processor that repeatedly: 1) observes the relative positions of those robots that are visible; 2) computes its new position based on the observation using the given algor ithm; 3) moves to that position. The robots' visibility is limited so that two robots can see each other if and only if they are within distance V of each other and there are no other robots between them. Our algorithm is memoryless in the sense that the nex t position of a robot is determined entirely from the positions of the robo ts that it can see at that moment. The correctness of the algorithm is prov ed formally under an abstract model of the robot system in which: 1) each robot is represented by a point that does not obstruct the view of other robots; 2) the robots' motion is instantaneous; 3) there are no sensor and control error; 4) the issue of collision is ignored. The results of computer simulation under a more realistic model give convin cing indication that the algorithm, if implemented on physical robots, will be robust against sensor and control error.