Ring Exploration with Oblivious Myopic Robots

摘要

The exploration problem in the discrete universe, using identical oblivious\nasynchronous robots without direct communication, has been well investigated.\nThese robots have sensors that allow them to see their environment and move\naccordingly. However, the previous work on this problem assume that robots have\nan unlimited visibility, that is, they can see the position of all the other\nrobots. In this paper, we consider deterministic exploration in an anonymous,\nunoriented ring using asynchronous, oblivious, and myopic robots. By myopic, we\nmean that the robots have only a limited visibility. We study the computational\nlimits imposed by such robots and we show that under some conditions the\nexploration problem can still be solved. We study the cases where the robots\nvisibility is limited to 1, 2, and 3 neighboring nodes, respectively.\n