We investigate the terminating grid exploration for autonomous myopic luminous robots. Myopic robots mean that they can observe nodes only within a certain fixed distance, and luminous robots mean that they have light devices that can emit colors. First, we prove that, in the semi-synchronous and asynchronous models, three myopic robots are necessary to achieve the terminating grid exploration if the visible distance is one. Next, we give fourteen algorithms for the terminating grid exploration in various assumptions of synchrony (fully-synchronous, semi-synchronous, and asynchronous models), visible distance, the number of colors, and a chirality. Six of them are optimal in terms of the number of robots.

翻译：我们调查了自主近光光机器人的终止网格探索。 近光机器人意味着它们只能在一定的固定距离内观测节点,而光亮机器人意味着它们拥有能够释放颜色的光设备。 首先,我们证明,在半同步和不同步模型中,如果可见距离为一,三个近光机器人对于实现终止网格探索是必要的。 其次,我们给出了14种算法,用于在同步(完全同步、半同步和不同步模型)、可见距离、颜色数量和体力等各种假设中终止网格探索。 其中6种在机器人数量上是最佳的。