Abstract
Formation problems of geometric patterns in the plane by the robots are studied. Algorithms are given for converging the robots to a single point and moving the robots to a single point in finite steps. In addition, the class of geometric patterns that the robots can form in terms of their initial configuration are also characterized.
Original language | English |
---|---|
Pages (from-to) | 1347-1363 |
Number of pages | 17 |
Journal | SIAM Journal on Computing |
Volume | 28 |
Issue number | 4 |
DOIs | |
Publication status | Published - 1999 |
All Science Journal Classification (ASJC) codes
- Computer Science(all)
- Mathematics(all)