Scatter of Weak Robots
分布式、并行与集群计算
2016-08-14 v1
摘要
In this paper, we first formalize the problem to be solved, i.e., the Scatter Problem (SP). We then show that SP cannot be deterministically solved. Next, we propose a randomized algorithm for this problem. The proposed solution is trivially self-stabilizing. We then show how to design a self-stabilizing version of any deterministic solution for the Pattern Formation and the Gathering problems.
引用
@article{arxiv.cs/0701179,
title = {Scatter of Weak Robots},
author = {Yoann Dieudonné and Franck Petit},
journal= {arXiv preprint arXiv:cs/0701179},
year = {2016}
}