An introduction to genetic algorithms
An introduction to genetic algorithms
An aperiodic set of 13 Wang tiles
Discrete Mathematics
The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Combinatorial optimization problems in self-assembly
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A new kind of science
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Self-Made Tapestry: Pattern Formation in Nature
The Self-Made Tapestry: Pattern Formation in Nature
Algorithmic Self-assembly Of DNA Tiles And Its Application To Cryptanalysis
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
String Tile Models for DNA Computing by Self-Assembly
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Morphological Image Analysis: Principles and Applications
Morphological Image Analysis: Principles and Applications
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Algorithmic self-assembly of dna
Algorithmic self-assembly of dna
Reducing tile complexity for self-assembly through temperature programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Techniques for highly multiobjective optimisation: some nondominated points are better than others
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Solving NP-complete problems in the tile assembly model
Theoretical Computer Science
Complexity classes for self-assembling flexible tiles
Theoretical Computer Science
Constant-size tileset for solving an NP-complete problem in nondeterministic linear time
DNA13'07 Proceedings of the 13th international conference on DNA computing
Watson---Crick palindromes in DNA computing
Natural Computing: an international journal
Evolving physical self-assembling systems in two-dimensions
ICES'10 Proceedings of the 9th international conference on Evolvable systems: from biology to hardware
Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
Being able to engineer a set of components and their corresponding environmental conditions such that target entities emerge as the result of self-assembly remains an elusive goal. In particular, understanding how to exploit physical properties to create self-assembling systems in three dimensions (in terms of component movement) with symmetric and asymmetric features is extremely challenging. Furthermore, primarily top-down design methodologies have been used to create physical self-assembling systems. As the sophistication of these systems increases, it will be more challenging to use top-down design due to self-assembly being an algorithmically NP-complete problem. In this work, we first present a nature-inspired approach to demonstrate how physically encoded information can be used to program and direct the self-assembly process in three dimensions. Second, we extend our nature-inspired approach by incorporating evolutionary computing, to couple bottom-up construction (self-assembly) with bottom-up design (evolution). To demonstrate our design approach, we present eight proof-of-concept experiments where virtual component sets either defined (programmed) or generated (evolved) during the design process have their specifications translated and fabricated using rapid prototyping. The resulting mechanical components are placed in a jar of fluid on an orbital shaker, their environment. The energy and physical properties of the environment, along with the physical properties of the components (including complementary shapes and magnetic-bit patterns, created using permanent magnets to attract and repel components) are used to engineer the self-assembly process to create emergent target structures with three-dimensional symmetric and asymmetric features. The successful results demonstrate how physically encoded information can be used with programming and evolving physical self-assembling systems in three dimensions.