All for one and one for all: an O(1)-musketeers generic transformation for rotating robots
From MaRDI portal
All for one and one for all: an \(O(1)\)-musketeers generic transformation for rotating robots
Cites work
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- All for one and one for all: an O(1)-musketeers generic transformation for rotating robots
- An introduction to tile-based self-assembly and a survey of recent results
- Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
- Computation in networks of passively mobile finite-state sensors
- Computation with finite stochastic chemical reaction networks
- Distributed transformations of Hamiltonian shapes based on line moves
- On efficient connectivity-preserving transformations in a grid
- On geometric shape construction via growth operations
- On the exponential growth of geometric shapes
- On the runtime of universal coating for programmable matter
- On the transformation capability of feasible mechanisms for programmable matter
- Polylogarithmic time algorithms for shortest path forests in programmable matter
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Pushing squares around
- Simple and efficient local codes for distributed stable network construction
- The complexity of growing a graph
- The program-size complexity of self-assembled squares (extended abstract)
- Timing in chemical reaction networks
- Transformation of modular robots by rotation: 3 + 1 musketeers for all orthogonally convex shapes
- Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
Cited in
(1)
This page was built for publication: All for one and one for all: an \(O(1)\)-musketeers generic transformation for rotating robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6903533)