Connected reconfiguration of lattice-based cellular structures by finite-memory robots
From MaRDI portal
Publication:5918539
DOI10.1007/s00453-022-00995-zOpenAlexW4283451244MaRDI QIDQ5918539
Christian Scheffer, Eike Niehs, Sándor P. Fekete, Arne Schmidt
Publication date: 6 October 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00995-z
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An introduction to tile-based self-assembly and a survey of recent results
- Universal coating for programmable matter
- Gathering of asynchronous robots with limited visibility
- Setting port numbers for fast graph exploration
- Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
- Gathering few fat mobile robots in the plane
- Forming tile shapes with simple robots
- Optimal staged self-assembly of general shapes
- Shape formation by programmable particles
- Optimal torus exploration by oblivious robots
- CADbots: algorithmic aspects of manipulating programmable matter with finite automata
- Asynchronous deterministic rendezvous in graphs
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Map construction of unknown graphs by multiple agents
- Deterministic rendezvous in graphs
- Graph exploration by a finite automaton
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- On the Runtime of Universal Coating for Programmable Matter
- Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection
- Leader Election and Shape Formation with Self-organizing Programmable Matter
- Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Distributed Computing by Mobile Robots: Gathering
- Tree exploration with logarithmic memory
- Collective tree exploration
- Tree exploration with little memory
- The Rendezvous Search Problem
- Exploring Unknown Undirected Graphs
- Shape recognition by a finite automaton robot
- Improved Leader Election for Self-organizing Programmable Matter
- Full Tilt: Universal Constructors for General Shapes with Uniform External Forces
- Memory Efficient Anonymous Graph Exploration
- STACS 2004
- Computing by Mobile Robotic Sensors
- Algorithms – ESA 2005
- The rendezvous problem on discrete locations
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots
This page was built for publication: Connected reconfiguration of lattice-based cellular structures by finite-memory robots
