Modular Self-Reconfigurable Robot Systems

The field of modular self-reconfigurable robotic systems addresses the design, fabrication, motion planning, and control of autonomous kinematic machines with variable morphology. Modular self-reconfigurable systems have the promise of making significant technological advances to the field of robotics in general. Their promise of high versatility, high value, and high robustness may lead to a radical change in automation. Currently, a number of researchers have been addressing many of the challenges. While some progress has been made, it is clear that many challenges still exist. By illustrating several of the outstanding issues as grand challenges that have been collaboratively written by a large number of researchers in this field, this article has shown several of the key directions for the future of this growing fiel

The Propulsion of Reconfigurable Modular Robots in Fluidic Environments

Reconfigurable modular robots promise to transform the way robotic systems are designed and operated. Fluidic or microgravity environments, which can be difficult or dangerous for humans to work in, are ideal domains for the use of modular systems. This thesis proposes that combining effective propulsion, large reconfiguration space and high scalability will increase the utility of modular robots. A novel concept for the propulsion of reconfigurable modular robots is developed. Termed Modular Fluidic Propulsion (MFP), this concept describes a system that propels by routing fluid though itself. This allows MFP robots to self-propel quickly and effectively in any configuration, while featuring a cubic lattice structure. A decentralized occlusion-based motion controller for the system is developed. The simplicity of the controller, which requires neither run-time memory nor computation via logic units, combined with the simple binary sensors and actuators of the robot, gives the system a high level of scalabilty. It is proven formally that 2-D MFP robots are able to complete a directed locomotion task under certain assumptions. Simulations in 3-D show that robots composed of 125 modules in a variety of configurations can complete the task. A hardware prototype that floats on the surface of water is developed. Experiments show that robots composed of four modules can complete the task in any configuration. This thesis also investigates the evo-bots, a self-reconfigurable modular system that floats in 2-D on an air table. The evo-bot system uses a stop-start propulsion mechanism to choose between moving randomly or not moving at all. This is demonstrated experimentally for the first time. In addition, the ability of the modules to detect, harvest and share energy, as well as self-assemble into simple structures, is demonstrated

A new meta-module for efficient reconfiguration of hinged-units modular robots

We present a robust and compact meta-module for edge-hinged modular robot units such as M-TRAN, SuperBot, SMORES, UBot, PolyBot and CKBot, as well as for central-point-hinged ones such as Molecubes and Roombots. Thanks to the rotational degrees of freedom of these units, the novel meta-module is able to expand and contract, as to double/halve its length in each dimension. Moreover, for a large class of edge-hinged robots the proposed meta-module also performs the scrunch/relax and transfer operations required by any tunneling-based reconfiguration strategy, such as those designed for Crystalline and Telecube robots. These results make it possible to apply efficient geometric reconfiguration algorithms to this type of robots. We prove the size of this new meta-module to be optimal. Its robustness and performance substantially improve over previous results.Peer ReviewedPostprint (author's final draft

Bio-inspired Tensegrity Soft Modular Robots

In this paper, we introduce a design principle to develop novel soft modular robots based on tensegrity structures and inspired by the cytoskeleton of living cells. We describe a novel strategy to realize tensegrity structures using planar manufacturing techniques, such as 3D printing. We use this strategy to develop icosahedron tensegrity structures with programmable variable stiffness that can deform in a three-dimensional space. We also describe a tendon-driven contraction mechanism to actively control the deformation of the tensegrity mod-ules. Finally, we validate the approach in a modular locomotory worm as a proof of concept.Comment: 12 pages, 7 figures, submitted to Living Machine conference 201

Correct-by-Construction Approach for Self-Evolvable Robots

The paper presents a new formal way of modeling and designing reconfigurable robots, in which case the robots are allowed to reconfigure not only structurally but also functionally. We call such kind of robots "self-evolvable", which have the potential to be more flexible to be used in a wider range of tasks, in a wider range of environments, and with a wider range of users. To accommodate such a concept, i.e., allowing a self-evovable robot to be configured and reconfigured, we present a series of formal constructs, e.g., structural reconfigurable grammar and functional reconfigurable grammar. Furthermore, we present a correct-by-construction strategy, which, given the description of a workspace, the formula specifying a task, and a set of available modules, is capable of constructing during the design phase a robot that is guaranteed to perform the task satisfactorily. We use a planar multi-link manipulator as an example throughout the paper to demonstrate the proposed modeling and designing procedures.Comment: The paper has 17 pages and 4 figure

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 precisely, we show that five extra "helper" modules ("musketeers") suffice to reconfigure the remaining n modules between any two given configurations. Our algorithm uses O(n^2) pivot moves, which is worst-case optimal. Previous reconfiguration algorithms either require less restrictive "sliding" moves, do not preserve facet-connectivity, or for the setting we consider, could only handle a small subset of configurations defined by a local forbidden pattern. Configurations with the forbidden pattern do have disconnected reconfiguration graphs (discrete configuration spaces), and indeed we show that they can have an exponential number of connected components. But forbidding the local pattern throughout the configuration is far from necessary, as we show that just a constant number of added modules (placed to be freely reconfigurable) suffice for universal reconfigurability. We also classify three different models of natural pivot moves that preserve facet-connectivity, and show separations between these models