Forming tile shapes with simple robots

DOI10.1007/s11047-019-09774-2zbMath1530.68093OpenAlexW2992115521WikidataQ126668174 ScholiaQ126668174MaRDI QIDQ6151177

Dorian Rudolph, Christian Scheideler, Fabian Kuhn, Kristian Hinnenthal, Thim Strothmann, Robert Gmyr, Irina Kostitsyna

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/en/publications/354442ee-fab1-465c-bcb9-95cd6ff74e46

zbMATH Keywords

finite automatatilesreconfigurationshape formation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• An introduction to tile-based self-assembly and a survey of recent results
• New geometric algorithms for fully connected staged self-assembly
• An annotated bibliography on guaranteed graph searching
• Autonomous programmable DNA nanorobotic devices using DNAzymes
• Pushing blocks is hard.
• On the Runtime of Universal Coating for Programmable Matter
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• The program-size complexity of self-assembled squares (extended abstract)
• Evaluating efficiency of self-reconfiguration in a class of modular robots
• Origamizer: A Practical Algorithm for Folding Any Polyhedron
• Shape recognition by a finite automaton robot
• Simple and efficient local codes for distributed stable network construction

This page was built for publication: Forming tile shapes with simple robots