Optimal rules for programmed stochastic self-assembly

38Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.

Abstract

We consider the control of programmable selfassembling systems whose dynamics are governed by stochastic reaction-diffusion dynamics. In our system, particles may decide the outcomes of reactions initiated by the environment, thereby steering the global system to produce a desired assembly type. We describe a method that automatically generates a program maximizing yield based on tuning the rates of experimentally determined reaction pathways. We demonstrate the method using theoretical examples and with a robotic testbed. Finally, we present, in the form of a graph grammar, a communication protocol that implements the generated programs in a distributed manner.

Cite

CITATION STYLE

APA

Klavins, E., Burden, S., & Napp, N. (2006). Optimal rules for programmed stochastic self-assembly. In Robotics: Science and Systems (Vol. 2, pp. 9–16). MIT Press Journals. https://doi.org/10.15607/rss.2006.ii.002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free