Path finding in the tile assembly model

Theoretical Computer Science

Volumn 410, Issue 15, 2009, Pages 1461-1472

  Brun, Yuriy ^a   Reishus, Dustin ^a  

^a University of Southern California ^*  (United States)

Author keywords

Amorphous computing; Crystal growth; Molecular computation; Natural computation; Path finding; Robotics; Self assembly; Swarm computing; Tile assembly model

Indexed keywords

BIOLOGICAL SYSTEMS; CRYSTAL GROWTH; CRYSTALLIZATION; GRAIN BOUNDARIES; ROBOTICS; ROBOTS; SELF ASSEMBLY;

AMORPHOUS COMPUTING; MOLECULAR COMPUTATION; NATURAL COMPUTATION; PATH-FINDING; SWARM COMPUTING;

ROBOTIC ASSEMBLY;

EID: 60649117529     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.12.008     Document Type: Article

References (45)

1. Abelson H., Allen D., Coore D., Hanson C., Homsy G., Knight Jr. T.F., Nagpal R., Rauch E., Sussman G.J., and Weiss R. Amorphous computing. Communications of the ACM 43 5 (2000) 74-82
2. L. Adleman, Towards a mathematical theory of self-assembly, Tech. Rep. 00722, Department of Computer Science, University of Southern California, Los Angleles, CA, 2000
3. L. Adleman, Q. Cheng, A. Goel, M.-D. Huang, D. Kempe, P. Moisset de Espanés, P.W.K. Rothemund, Combinatorial optimization problems in self-assembly, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC02, Montreal, Quebec, Canada, 2002
4. L. Adleman, Q. Cheng, A. Goel, M.-D. Huang, H. Wasserman, Linear self-assemblies: Equilibria, entropy, and convergence rates, in: Proceedings of the 6th International Conference on Difference Equations and Applications, ICDEA01, Augsburg, Germany, 2001
5. L. Adleman, A. Goel, M.-D. Huang, P. Moisset de Espanés, Running time and program size for self-assembled squares, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC02, Montreal, Quebec, Canada, 2002
6. L. Adleman, J. Kari, L. Kari, D. Reishus, On the decidability of self-assembly of infinite ribbons, in: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS02, Ottawa, Ontario, Canada, 2002
7. Aggarwal G., Cheng Q., Goldwasser M.H., Kao M.-Y., Moisset de Espanés P., and Schweller R.T. Complexities for generalized models of self-assembly. SIAM Journal on Computing 34 6 (2005) 1493-1515
8. D.J. Arbuckle, A.A.G. Requicha, Active self-assembly, in: Proceedings of the IEEE International Conference on Robotics and Automation, ICRA04, New Orleans, LA, USA, 2004
9. Barish R., Rothemund P.W.K., and Winfree E. Two computational primitives for algorithmic self-assembly: Copying and counting. Nano Letters 5 12 (2005) 2586-2592
10. Y. Baryshnikov, E.G. Coffman, N. Seeman, T. Yimwadsana, Self correcting self assembly: Growth models and the hammersley process, in: Proceedings of the 11th International Meeting on DNA Computing, DNA05, London, Ontario, 2005
11. Berger R. The Undecidability of the Domino Problem. Memoirs Series vol. 66 (1966), American Mathematical Society
12. Brun Y. Arithmetic computation in the tile assembly model: Addition and multiplication. Theoretical Computer Science 378 1 (2007) 17-31
13. Brun Y. Nondeterministic polynomial time factoring in the tile assembly model. Theoretical Computer Science 395 1 (2008) 3-23
14. Brun Y. Solving NP-complete problems in the tile assembly model. Theoretical Computer Science 395 1 (2008) 31-46
15. W.J. Butera, Programming a paintable computer, Ph.D. Thesis, Massachussetts Institute of Technology, Cambridge, MA, USA, February 2002
16. Chelyapov N., Brun Y., Gopalkrishnan M., Reishus D., Shaw B., and Adleman L. DNA triangles and self-assembled hexagonal tilings. Journal of American Chemical Society (JACS) 126 43 (2004) 13924-13925
17. H.-L. Chen, A. Goel, Error free self-assembly with error prone tiles, in: Proceedings of the 10th International Meeting on DNA Based Computers, DNA04, Milan, Italy, 2004
18. L. Clement, R. Nagpal, Self-assembly and self-repairing topologies, in: Proceedings of the Workshop on Adaptability in Multi-Agent Systems, RoboCup Australian Open, 2003
19. M. Cook, P.W.K. Rothemund, E. Winfree, Self-assembled circuit patterns, in: Proceedings of the 9th International Meeting on DNA Based Computers, DNA03, Madison, WI, USA, 2003
20. Ebbinghaus H.-D. Undecidability of some domino connectability problems. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 28 (1982) 331-336
21. Ebbinghaus H.-D. Domino threads and complexity. Lecture Notes in Computer Science (1987) 131-142
22. Etzion-Petruschka Y., Harel D., and Myers D. On the solvability of domino snake problems. Theoretical Computer Science 131 2 (1994) 243-269
23. Fu T.J., and Seeman N.C. DNA double-crossover molecules. Biochemistry 32 13 (1993) 3211-3220
24. M.-Y. Kao, R. Schweller, Reducing tile complexity for self-assembly through temperature programming, in: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA06, Miami, FL, USA, 2006
25. A. Kondacs, Biologically-inspired self-assembly of two-dimensional shapes using global-to-local compilation, in: Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI03, Acapulco, Mexico, 2003
26. Lagoudakis M.G., and LaBean T.H. 2D DNA self-assembly for satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 54 (1999) 141-154
27. J. McLurkin, J. Smith, J. Frankel, D. Sotkowitz, D. Blau, B. Schmidt, Speaking swarmish: Human-robot interface design for large swarms of autonomous mobile robots, in: Proceedings of the AAAI Spring Symposium, Stanford, CA, USA, 2006
28. P. Moisset de Espanés, Computerized exhaustive search for optimal self-assembly counters, in: Proceedings of the 2nd Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO05, Snowbird, UT, USA, 2005
29. Myers D. Decidability of the tiling connectivity problem. Notices of the American Mathematical Society 195 26 (1979) A-441
30. R. Nagpal, Programmable self-assembly: Constructing global shape using biologically-inspired local interactions and origami mathematics, Ph.D. Thesis, Massachussetts Institute of Technology, Cambridge, MA, USA, June 2001
31. J.H. Reif, S. Sahu, P. Yin, Compact error-resilient computational DNA tiling assemblies, in: Proceedings of the 10th International Meeting on DNA Based Computers, DNA04, Milan, Italy, 2004
32. D. Reishus, Design of a self-assembled memory circuit, in: Proceedings of the 5th Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO08, Snowbird, UT, USA, 2008
33. Reishus D., Shaw B., Brun Y., Chelyapov N., and Adleman L. Self-assembly of DNA double-double crossover complexes into high-density, doubly connected, planar structures. Journal of American Chemical Society (JACS) 127 50 (2005) 17590-17591
34. Robinson R.M. Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae 12 3 (1971) 177-209
35. Rothemund P.W.K., Papadakis N., and Winfree E. Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biology 2 12 (2004) e424
36. P.W.K. Rothemund, E. Winfree, The program-size complexity of self-assembled squares, in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC00, Portland, OR, USA, 2000
37. Shen W.-M., Krivokon M., Chiu H., Everist J., Rubenstein M., and Venkatesh J. Multimode locomotion for reconfigurable robots. Autonomous Robots 20 2 (2006) 165-177
38. Soloveichik D., Cook M., and Winfree E. Combining self-healing and proofreading in self-assembly. Natural Computing 7 2 (2008) 203-218
39. Wang H. Proving theorems by pattern recognition, II. Bell System Technical Journal 40 (1961) 1-42
40. Winfree E. On the computational power of DNA annealing and ligation. DNA Based Computers (1996) 199-221
41. E. Winfree, Algorithmic self-assembly of DNA, Ph.D. Thesis, California Institute of Technology, Pasadena, CA, USA, June 1998
42. E. Winfree, Simulations of computing by self-assembly of DNA, Tech. Rep. CSTR:1998:22, California Institute of Technology, Pasadena, CA, USA, 1998
43. Winfree E. Self-healing tile sets. Nanotechnology: Science and Computation (2006) 55-78
44. E. Winfree, R. Bekbolatov, Proofreading tile sets: Error correction for algorithmic self-assembly, in: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS02, vol. 2943, Madison, WI, USA, 2003
45. Yan H., Park S.H., Finkelstein G., Reif J.H., and LaBean T.H. DNA-templated self-assembly of protein arrays and highly conductive nanowires. Science 301 (2003) 1882-1884