Consider a group of autonomous mobile computational entities called robots. The robots move in the Euclidean plane and operate according to synchronous $Look$-$Compute$-$Move$ cycles. The computational capabilities of the robots under the four traditional models $\{ \mathcal{OBLOT},\ \mathcal{FSTA},\ \mathcal{FCOM},\ \mathcal{LUMI} \} $ have been extensively investigated both when the robots had unlimited amount of energy and when the robots were energy-constrained. In both the above cases, the robots had full visibility. In this paper, this assumption is removed, i.e., we assume that the robots can view up to a constant radius $V_r$ from their position (the $V_r$ is same for all the robots) and, investigates what impact it has on its computational capabilities. We first study whether the restriction imposed on the visibility has any impact at all, i.e., under a given model and scheduler does there exist any problem which cannot be solved by a robot having limited visibility but can be solved by a robot with full visibility. We find that the answer to the question in general turns out to be positive. Next we try to get an idea that under a given model, which of the two factors, $Visibility$ or $Synchronicity$ is more powerful and conclude that a definite conclusion cannot be drawn. We restrict our investigations to $\{ \mathcal{OBLOT},\ \mathcal{FSTA},\ \mathcal{FCOM} \}$ models and to synchronous schedulers only. The results in $\mathcal{LUMI}$ model is yet to be determined.

翻译：考虑一组称为机器人的自主移动计算实体。机器人在欧几里得平面上移动，并按照同步的$Look$-$Compute$-$Move$周期运行。在四种传统模型$\{ \mathcal{OBLOT},\ \mathcal{FSTA},\ \mathcal{FCOM},\ \mathcal{LUMI} \}$下，机器人无论拥有无限能量还是能量受限，其计算能力已被广泛研究。在上述两种情形中，机器人均具备完全可见性。本文去除了这一假设，即假设机器人只能从其位置观察到恒定半径$V_r$范围内的环境（所有机器人的$V_r$相同），并研究这对机器人计算能力的影响。我们首先探究可见性限制是否产生任何影响，即在给定模型和调度器下，是否存在某些问题无法由有限可见性机器人解决，但可由完全可见性机器人解决。我们发现该问题的答案通常是肯定的。接着，我们尝试了解在给定模型下，$可见性$与$同步性$这两个因素中哪个更强大，并得出结论：无法得出明确结论。我们将研究范围限定在$\{ \mathcal{OBLOT},\ \mathcal{FSTA},\ \mathcal{FCOM} \}$模型及同步调度器内。$\mathcal{LUMI}$模型中的结果仍有待确定。