On the solvability of domino snake problems
Theoretical Computer Science
Communications of the ACM
The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Running time and program size for self-assembled squares
STOC '01 Proceedings of the thirty-third 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
On the Decidability of Self-Assembly of Infinite Ribbons
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Computation Theory and Logic, In Memory of Dieter Rödding
Algorithmic self-assembly of dna
Algorithmic self-assembly of dna
Programmable self-assembly: constructing global shape using biologically-inspired local interactions and origami mathematics
Programming a paintable computer
Programming a paintable computer
Complexities for Generalized Models of Self-Assembly
SIAM Journal on Computing
Reducing tile complexity for self-assembly through temperature programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Multimode locomotion via SuperBot reconfigurable robots
Autonomous Robots
Arithmetic computation in the tile assembly model: Addition and multiplication
Theoretical Computer Science
Nondeterministic polynomial time factoring in the tile assembly model
Theoretical Computer Science
Solving NP-complete problems in the tile assembly model
Theoretical Computer Science
Combining self-healing and proofreading in self-assembly
Natural Computing: an international journal
Biologically-inspired self-assembly of two-dimensional shapes using global-to-local compilation
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Self-correcting self-assembly: growth models and the hammersley process
DNA'05 Proceedings of the 11th international conference on DNA Computing
Error free self-assembly using error prone tiles
DNA'04 Proceedings of the 10th international conference on DNA computing
Compact error-resilient computational DNA tiling assemblies
DNA'04 Proceedings of the 10th international conference on DNA computing
Efficient 3-SAT algorithms in the tile assembly model
Natural Computing: an international journal
| Hi-index | 5.23 |
Swarm robotics, active self-assembly, and amorphous computing are fields that focus on designing systems of large numbers of small, simple components that can cooperate to complete complex tasks. Many of these systems are inspired by biological systems, and all attempt to use the simplest components and environments possible, while still being capable of achieving their goals. The canonical problems for such biologically-inspired systems are shape assembly and path finding. In this paper, we demonstrate path finding in the well-studied tile assembly model, a model of molecular self-assembly that is strictly simpler than other biologically-inspired models. As in related work, our systems function in the presence of obstacles and can be made fault-tolerant. The path-finding systems use @Q(1) distinct components and find minimal-length paths in time linear in the length of the path.