在能见度极低的情况下聚集
Gathering with extremely restricted visibility
摘要：
我们考虑的经典问题，使移动过程聚集或收敛在同一个位置（如在自然界中的动物群）。现有的工作假设每个进程可以看到所有其他进程，或在一定半径内的所有进程。在本文中，我们引入了一个新的模型，具有极其有限的可见性：每个进程只能看到一个其他进程（其最近的邻居）。我们的目标是看看是否（以及在多大程度上）聚集和收敛问题可以在这种情况下得到解决。我们首先表明，令人惊讶的是，这个问题可以解决少数进程（最多5），但不能超越。这是由于不确定性的情况下，有几个最接近的邻居为同一进程。通过去除这种不确定性与一个额外的假设（选择最近的邻居根据顺序的位置的进程），然后我们表明，这个问题可以解决任何数量的进程。我们还表明，最多一个崩溃故障可以容忍的收敛问题。
英文摘要：
We consider the classical problem of making mobile processes gather or converge at a same position (as performed by swarms of animals in Nature). Existing works assume that each process can see all other processes, or all processes within a certain radius. In this paper, we introduce a new model with an extremely restricted visibility: each process can only see one other process (its closest neighbor). Our goal is to see if (and to what extent) the gathering and convergence problems can be solved in this setting. We first show that, surprisingly, the problem can be solved for a small number of processes (at most 5), but not beyond. This is due to indeterminacy in the case where there are several closest neighbors for a same process. By removing this indeterminacy with an additional hypothesis (choosing the closest neighbor according to an order on the positions of processes), we then show that the problem can be solved for any number of processes. We also show that up to one crash failure can be tolerated for the convergence problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
