Name
Abstract | ||
|---|---|---|
In this paper, we investigate the scatter problem, which is defined as follows: Given a set of n robots, regardless of the initial position of the robots on the plane, eventually, no two robots are located at the same position forever. We show that this problem cannot be deterministically solved. Next, we propose a randomized algorithm. 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 for any number n >= 2 of robots. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1142/S0129626409000146 | PARALLEL PROCESSING LETTERS |
Keywords | Field | DocType |
Distributed Algorithms, Mobile Robot Networks, Stabilization | Mobile computing,Wireless network,Randomized algorithm,Computer science,Algorithm,Fault tolerance,Distributed algorithm,Artificial intelligence,Robot,Deterministic system (philosophy),Robotics | Journal |
Volume | Issue | ISSN |
19 | 1 | 0129-6264 |
Citations | PageRank | References |
4 | 0.48 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoann Dieudonné | 1 | 221 | 19.88 |
| Franck Petit | 2 | 736 | 60.02 |