暂无分享,去创建一个
[1] Erik Winfree,et al. The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.
[2] Paul G. Spirakis,et al. Elements of the theory of dynamic networks , 2018, Commun. ACM.
[3] Nicola Santoro,et al. Forming sequences of geometric patterns with oblivious mobile robots , 2015, Distributed Computing.
[4] Nicola Santoro,et al. Distributed Computing by Mobile Robots: Gathering , 2012, SIAM J. Comput..
[5] Satish Rao,et al. Approximation schemes for Euclidean k-medians and related problems , 1998, STOC '98.
[6] Paul G. Spirakis,et al. On the Transformation Capability of Feasible Mechanisms for Programmable Matter , 2017, ICALP.
[7] Andrzej Pelc,et al. Building a Nest by an Automaton , 2019, Algorithmica.
[8] Masafumi Yamashita,et al. Formations for Fast Locomotion of Metamorphic Robotic Systems , 2004, Int. J. Robotics Res..
[9] David Doty,et al. Theory of algorithmic self-assembly , 2012, CACM.
[10] Christian Scheideler,et al. Universal Shape Formation for Programmable Matter , 2016, SPAA.
[11] Zack J. Butler,et al. Generic Decentralized Control for Lattice-Based Self-Reconfigurable Robots , 2004, Int. J. Robotics Res..
[12] Erik Winfree,et al. Active self-assembly of algorithmic shapes and patterns in polylogarithmic time , 2013, ITCS '13.
[13] Radhika Nagpal,et al. Programmable self-assembly in a thousand-robot swarm , 2014, Science.
[14] Othon Michail,et al. Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter , 2019, ALGOSENSORS.
[15] Julien Bourgeois,et al. Distributed Intelligent MEMS: Progresses and Perspectives , 2011, ICT Innovations.
[16] Michael J. Fischer,et al. Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.
[17] Nancy M. Amato,et al. Distributed reconfiguration of metamorphic robot chains , 2004, PODC '00.
[18] David Eisenstat,et al. The computational power of population protocols , 2006, Distributed Computing.
[19] Daniela Rus,et al. Robot pebbles: One centimeter modules for programmable matter through self-disassembly , 2010, 2010 IEEE International Conference on Robotics and Automation.
[20] Gregory S. Chirikjian,et al. Modular Self-Reconfigurable Robot Systems , 2007 .
[21] Shawn M. Douglas,et al. Self-assembly of DNA into nanoscale three-dimensional shapes , 2009, Nature.
[22] Esther M. Arkin,et al. Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers , 2019, ESA.
[23] Masafumi Yamashita,et al. Motion planning for metamorphic systems: feasibility, decidability, and distributed reconfiguration , 2004, IEEE Transactions on Robotics and Automation.
[24] Yukiko Yamauchi,et al. Shape formation by programmable particles , 2017, Distributed Computing.
[25] Yukiko Yamauchi,et al. Brief Announcement: Pattern Formation Problem for Synchronous Mobile Robots in the Three Dimensional Euclidean Space , 2016, PODC.
[26] Masafumi Yamashita,et al. Characterizing geometric patterns formable by oblivious anonymous mobile robots , 2010, Theor. Comput. Sci..
[27] D. Cvetkovic,et al. Graph theory and molecular orbitals , 1974 .
[28] Sándor P. Fekete,et al. CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata , 2018, WAFR.
[29] Andrea E. F. Clementi,et al. On the bounded-hop MST problem on random Euclidean instances , 2007, Theor. Comput. Sci..
[30] I. Gutman,et al. Graph theory and molecular orbitals. XII. Acyclic polyenes , 1975 .
[31] P. Rothemund. Folding DNA to create nanoscale shapes and patterns , 2006, Nature.
[32] Erik D. Demaine,et al. Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves , 2008, ISAAC.
[33] Erik D. Demaine,et al. Efficient Reconfiguration of Lattice-Based Modular Robots , 2013, ECMR.
[34] Christian Scheideler,et al. Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 16271) , 2016, Dagstuhl Reports.
[35] Gregory S. Chirikjian,et al. Modular Self-Reconfigurable Robot Systems [Grand Challenges of Robotics] , 2007, IEEE Robotics & Automation Magazine.
[36] M. Sahani,et al. Algorithmic Self-Assembly of DNA , 2006 .
[37] Christian Scheideler,et al. On the runtime of universal coating for programmable matter , 2016, Natural Computing.
[38] János Pach,et al. Pushing squares around , 2004, SCG '04.
[39] Jayme Luiz Szwarcfiter,et al. Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..
[40] Christian Scheideler,et al. Forming tile shapes with simple robots , 2018, Natural Computing.
[41] Neil Gershenfeld,et al. The Milli-Motein: A self-folding chain of programmable matter with a one centimeter module pitch , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[42] Leonidas J. Guibas. Controlled Module Density Helps Reconfiguration Planning , 2000 .
[43] I. Gutman,et al. Graph theory and molecular orbitals. Total φ-electron energy of alternant hydrocarbons , 1972 .
[44] Paul G. Spirakis,et al. Simple and efficient local codes for distributed stable network construction , 2013, Distributed Computing.