In the modular robot reconfiguration problem, we are given n cube-shaped modules (or
robots) as well as two configurations, ie, placements of the n modules so that their union is …

The sliding cubes model is a well-established theoretical framework that supports the
analysis of reconfiguration algorithms for modular robots consisting of face-connected …

Consider an agent traversing a graph of “gadgets”, where each gadget has local state that
changes with each traversal by the agent according to specified rules. Prior work has …

We present an algorithm for self-reconfiguration of admissible 3D configurations of pivoting
modular cube robots with holes of arbitrary shape and number. Cube modules move across …

A well-established theoretical model for modular robots in two dimensions are edge-
connected configurations of square modules, which can reconfigure through so-called …

Recent work has developed a theory of motion-planning gadgets, which are a useful tool for
proving hardness for a variety of problems that can be thought of in terms of an agent …

We introduce and analyze a model for self-reconfigurable robots made up of unit-cube
modules. Compared to past models, our model aims to newly capture two important practical …

We consider algorithmic problems motivated by modular robotic reconfiguration, for which
we are given $ n $ square-shaped modules (or robots) in a (labeled or unlabeled) start …

In this paper, we explore how agent reachability problems from motion planning, games,
and puzzles can be generalized and analyzed from the perspective of block asynchronous …

We study a simple reconfigurable robot model which has not been previously examined:
cubic robots comprised of three-dimensional cubic modules which can slide across each …