Self-organizing Particle Systems

Maximilian Drees, Martina Hullmann, Andreas Koutsopoulos, Christian Scheideler
2012 2012 IEEE 26th International Parallel and Distributed Processing Symposium  
Nanoparticles are getting more and more in the focus of the scientific 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 specific geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the
more » ... owing 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 predefined aspect ratio. To the best of our knowledge this is the first work that considers arrangement problems for these types of robots.
doi:10.1109/ipdps.2012.116 dblp:conf/ipps/DreesHKS12 fatcat:p4o6josshjdzfbf27syul67uhm