2012 IEEE 26th International Parallel and Distributed Processing Symposium 2012
DOI: 10.1109/ipdps.2012.116
|View full text |Cite
|
Sign up to set email alerts
|

Self-organizing Particle Systems

Abstract: Abstract-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 following … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
1
1
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…However, we want all particles on the surface to move in a common direction. The simple procedure given in Algorithm 1, which is very similar to the moving algorithm presented by Drees et al [23], can be used to achieve this goal: A contracted particle uses Algorithm 1 Movement along a Surface let k be the size of the neighborhood of the particle (i.e., k = 6 or k = 10) let i be the label of an edge connected to the object while edge i is connected to the object do i ← (i − 1) mod k return i the procedure to compute the direction of an expansion, and an expanded particle simply contracts according to above definitions. The correctness of this approach is based on two facts.…”
Section: Moving Along a Surfacementioning
confidence: 99%

Infinite Object Coating in the Amoebot Model

Derakhshandeh,
Gmyr,
Richa
et al. 2014
Preprint
Self Cite
“…However, we want all particles on the surface to move in a common direction. The simple procedure given in Algorithm 1, which is very similar to the moving algorithm presented by Drees et al [23], can be used to achieve this goal: A contracted particle uses Algorithm 1 Movement along a Surface let k be the size of the neighborhood of the particle (i.e., k = 6 or k = 10) let i be the label of an edge connected to the object while edge i is connected to the object do i ← (i − 1) mod k return i the procedure to compute the direction of an expansion, and an expanded particle simply contracts according to above definitions. The correctness of this approach is based on two facts.…”
Section: Moving Along a Surfacementioning
confidence: 99%

Infinite Object Coating in the Amoebot Model

Derakhshandeh,
Gmyr,
Richa
et al. 2014
Preprint
Self Cite
“…Recent advances in controlling mechanisms in biological systems, such as cell signaling, cell movements and nano delivery devices for targeted treatments [2][3][4], motivates the need for further research in these areas. Computational models for programmable matters exist in computational geometry [5][6][7][8][9], synthetic biology [10][11][12], swarm robotics [13][14][15][16][17] and distributed computing [18,19]. DNA nanorobots fabricated using origami has also emerged recently as a promising research field for producible nanorobots [20,21].…”
Section: Introductionmentioning
confidence: 99%