Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
SIAM Journal on Computing
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Circle formation for oblivious anonymous mobile robots with no common sense of orientation
Proceedings of the second ACM international workshop on Principles of mobile computing
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Agreement on a Common X - Y Coordinate System by a Group of Mobile Robots
Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996]
Circle formation of weak robots and Lyndon words
Information Processing Letters
Circle formation of weak mobile robots
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Solving the robots gathering problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Swing words to make circle formation quiescent
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Biangular circle formation by asynchronous mobile robots
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Swing words to make circle formation quiescent
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
The cost of probabilistic agreement in oblivious robot networks
Information Processing Letters
| Hi-index | 0.01 |
In this paper, we explain how Robert Langdon, a famous Harvard Professor of Religious Symbology, brought us to decipher the Code of the Origins. We first formalize the problem to be solved to understand the Code of the Origins. We call it the Scatter Problem (SP). We then show that the 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.