Abstract

AbstractMolecular robotics is challenging, so it seems best to keep it simple. We consider an abstract molecular robotics model based on simple folding instructions that execute asynchronously. Turning Machines are a simple 1D to 2D folding model, also easily generalisable to 2D to 3D folding. A Turning Machine starts out as a line of connected monomers in the discrete plane, each with an associated turning number. A monomer turns relative to its neighbours, executing a unit-distance translation that drags other monomers along with it, and through collective motion the initial set of monomers eventually folds into a programmed shape. We provide a suite of tools for reasoning about Turning Machines by fully characterising their ability to execute line rotations: executing an almost-full line rotation of $$5\pi /3$$ 5 π / 3 radians is possible, yet a full $$2\pi$$ 2 π rotation is impossible. Furthermore, line rotations up to $$5\pi /3$$ 5 π / 3 are executed efficiently, in $$O(\log n)$$ O ( log n ) expected time in our continuous time Markov chain time model. We then show that such line-rotations represent a fundamental primitive in the model, by using them to efficiently and asynchronously fold shapes. In particular, arbitrarily large zig-zag-rastered squares and zig-zag paths are foldable, as are y-monotone shapes albeit with error (bounded by perimeter length). Finally, we give shapes that despite having paths that traverse all their points, are in fact impossible to fold, as well as techniques for folding certain classes of (scaled) shapes without error. Our approach relies on careful geometric-based analyses of the feats possible and impossible by a very simple robotic system, and pushes conceptional hardness towards mathematical analysis and away from molecular implementation.

Highlights

  • The challenge of building molecular robots has many moving parts, as the saying goes

  • We show that for each of the angles h 2 fp=3; 2p=3; p; 4p=3; 5p=3g, and any number of monomers n 2 N there is a Turning Machine with n monomers that starts on the x-axis and ends rotated by h radians

  • Our Turning Machine model is a restriction of the nubot model (Woods et al 2013), a molecular robotic model with many features including self-assembly capabilities, random agitation of monomers, the ability to execute cellular automata style rules, and floppy/rigid molecular bonds

Read more

Summary

Introduction

The challenge of building molecular robots has many moving parts, as the saying goes. These include molecular parts that move relative to each other; units needing some sort of memory state; the ability to transition between states; and perhaps even the ability to use computation to drive robotic movements. We consider a simple algorithmic model of robotic reconfiguration called Turning Machines. On the other hand, building nanoscale components presents a number of challenges including implementing computational controllers at the nanoscale, as well as designing systems that self-assemble and interact in a regime where we can not send in human mechanics to diagnose and fix problems (Fig. 1)

Turning machines
The main challenge: blocking
Results: line rotations and shape building
Related and future work
Turning machine model definition
Introduction to line rotation turning machines
Tools for reasoning about turning machines
Line rotation
Negative result: line rotation to 2p is impossible
Folding shapes
Folding scaled shapes with 0-error
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call