6 accepted papers
This article presents a fast reconfiguration algorithm for cubic modular robots moving in narrow spaces. We assume that the cubic module can only slide across other modules’ surfaces, which saves space compared with previously studied cubic modules, such as those with rotating primitives. The algori
This paper presents a parallel permutation algorithm that achieves linear full-resolution reconfiguration of sliding-only cubic modular robots. We assume the use of a cubic module that can only slide across other modules' surfaces. The idea of a cubic modular robot with sliding-only motion primitive…
Reconfiguring heterogeneous modular robots in which all modules are not identical is much more time consuming than reconfiguring homogeneous ones, because ordinary heterogeneous reconfiguration is a combination of homogeneous transformation and heterogeneous permutation. While linear homogeneous tra…
This paper studies a reconfiguration algorithm for heterogeneous cubic modular robots in environments with obstacles. Tunneling is suitable for the transformation of cubic modular robots in such an environment because a tunneling robot only passes spaces that are occupied by the robot in the start a…
This paper presents a full-resolution reconfiguration algorithm for a heterogeneous modular robot composed of sliding cube modules with a limited motion primitive. We assume that a cube module is not allowed to make convex motions around other modules but is allowed to slide across other modules' su
This paper presents a reconfiguration algorithm for a robot composed of sliding cube modules with a limited motion primitive. We assume that a cube module is not allowed to make convex motions around other modules but is allowed to slide across other modules' surfaces. Such a motion primitive limita…