@inproceedings{581,
abstract = {{Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots.}},
author = {{Drees, Maximilian and HÃ¼llmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}},
booktitle = {{Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}},
pages = {{1272--1283}},
title = {{{Self-Organizing Particle Systems}}},
doi = {{10.1109/IPDPS.2012.116}},
year = {{2012}},
}