A survey of autonomous self-reconfiguration methods for robot-based programmable matter
While researchers envision exciting applications for metamorphic systems like
programmable matter, current solutions to the shape formation problem are still a long way …
programmable matter, current solutions to the shape formation problem are still a long way …
Shape formation by programmable particles
Shape formation (or pattern formation) is a basic distributed problem for systems of
computational mobile entities. Intensively studied for systems of autonomous mobile robots …
computational mobile entities. Intensively studied for systems of autonomous mobile robots …
Engineering efficient and massively parallel 3d self-reconfiguration using sandboxing, scaffolding and coating
Programmable matter based on modular self-reconfigurable robots could stand as the
ultimate form of display system, through which humans could not only see the virtual world in …
ultimate form of display system, through which humans could not only see the virtual world in …
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
We present the first universal reconfiguration algorithm for transforming a modular robot
between any two facet-connected square-grid configurations using pivot moves. More …
between any two facet-connected square-grid configurations using pivot moves. More …
Distributed self-reconfiguration using a deterministic autonomous scaffolding structure
In the context of large distributed modular robots, self-reconfiguration is the process of
having modules, seen as autonomous agents, acting together and moving to transform the …
having modules, seen as autonomous agents, acting together and moving to transform the …
Optimal in-place compaction of sliding cubes
The sliding cubes model is a well-established theoretical framework that supports the
analysis of reconfiguration algorithms for modular robots consisting of face-connected …
analysis of reconfiguration algorithms for modular robots consisting of face-connected …
[HTML][HTML] On geometric shape construction via growth operations
We study algorithmic growth processes under a geometric setting. Each process begins with
an initial shape of nodes SI= S 0 and, in every time step t≥ 1, by applying (in parallel) one or …
an initial shape of nodes SI= S 0 and, in every time step t≥ 1, by applying (in parallel) one or …
Compacting squares: Input-sensitive in-place reconfiguration of sliding squares
A well-established theoretical model for modular robots in two dimensions are edge-
connected configurations of square modules, which can reconfigure through so-called …
connected configurations of square modules, which can reconfigure through so-called …
Terminating distributed construction of shapes and patterns in a fair solution of automata
O Michail - Proceedings of the 2015 ACM Symposium on …, 2015 - dl.acm.org
In this work, we consider a solution of automata similar to Population Protocols and Network
Constructors. The automata, also called nodes, move passively in a well-mixed solution and …
Constructors. The automata, also called nodes, move passively in a well-mixed solution and …
[HTML][HTML] Pushing lines helps: Efficient universal centralised transformations for programmable matter
In this work, we study a discrete system of entities residing on a two-dimensional square
grid. Each entity is modelled as a node occupying a distinct cell of the grid. The set of all n …
grid. Each entity is modelled as a node occupying a distinct cell of the grid. The set of all n …