We investigate exploration algorithms for autonomous mobile robots evolving in uniform ring-shaped networks. Unlike previous works, we consider myopia (each robot can only observe its neighboring nodes) and luminosity (each robot can use only two colors for its light) properties for the robots.

As a main contribution, we prove that (i) in the FSYNC model, two (resp. three) myopic robots are necessary and sufficient to achieve perpetual (resp. terminating) exploration, and (ii) in the SSYNC and ASYNC models, three (resp. four) myopic robots are necessary and sufficient to achieve perpetual (resp. terminating) exploration.

We also show that, in all execution models, our perpetual exploration algorithm is universal. That is, the algorithm solves perpetual exploration from any solvable initial configuration with two (resp. three) myopic robots and two colors in the FSYNC model (resp. the SSYNC and ASYNC models). On the other hand, we provide impossibility results for universal terminating exploration.

我们研究了在均匀环形网络中演化的自主移动机器人的探索算法。与以前的作品不同，我们考虑了机器人的近视（每个机器人只能观察其相邻节点）和光度（每个机器人只能使用两种颜色的光）属性。

作为主要贡献，我们证明了（i）在 FSYNC 模型中，两个（分别是三个）近视机器人对于实现永久（分别终止）探索是必要和充分的，并且（ii）在 SSYNC 和 ASYNC 模型中，三个（分别是四）近视机器人是实现永久（或终止）探索的必要且充分的。

我们还表明，在所有执行模型中，我们的永久探索算法是通用的。也就是说，该算法通过 FSYNC 模型（分别是 SSYNC 和 ASYNC 模型）中的两个（或三个）近视机器人和两种颜色来解决任何可解初始配置的永久探索。另一方面，我们为普遍终止探索提供了不可能的结果。