Distributed transformations of Hamiltonian shapes based on line moves
From MaRDI portal
Publication:5918588
DOI10.1016/j.tcs.2022.11.029OpenAlexW3195183110MaRDI QIDQ5918588
Othon Michail, Igor Potapov, Abdullah Almethen
Publication date: 21 December 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.029
distributed algorithmsprogrammable matterdiscrete transformationsshape formationreconfigurable roboticsline movement
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric computations by broadcasting automata
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- On the transformation capability of feasible mechanisms for programmable matter
- Shape formation by programmable particles
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Building a nest by an automaton
- CADbots: algorithmic aspects of manipulating programmable matter with finite automata
- Computation in networks of passively mobile finite-state sensors
- Efficient reconfiguration of lattice-based modular robots
- Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
- Leader Election and Shape Formation with Self-organizing Programmable Matter
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- The program-size complexity of self-assembled squares (extended abstract)
- Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Hamilton Paths in Grid Graphs
- Broadcasting Automata and Patterns on ℤ2
- Distributed reconfiguration of metamorphic robot chains
- Pattern Formation by Oblivious Asynchronous Mobile Robots
- Pushing squares around
- Simple and efficient local codes for distributed stable network construction
- Traversing a set of points with a minimum number of turns
- On efficient connectivity-preserving transformations in a grid
- Distributed transformations of Hamiltonian shapes based on line moves
- Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
- On the computational power of DNA
