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

Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves

We consider the theoretical model of Crystalline robots, which have been introduced and prototyped by the robotics community. These robots consist of independently manipulable unit-square atoms that can extend/contract arms on each side and attach/detach from neighbors. These operations suffice to reconfigure between any two given (connected) shapes. The worst-case number of sequential moves required to transform one connected configuration to another is known to be Theta(n). However, in principle, atoms can all move simultaneously. We develop a parallel algorithm for reconfiguration that runs in only O(log n) parallel steps, although the total number of operations increases slightly to Theta(nlogn). The result is the first (theoretically) almost-instantaneous universally reconfigurable robot built from simple units.Comment: 21 pages, 10 figure

Heterogeneous Self-Reconfiguring Robotics: Ph.D. Thesis Proposal

Self-reconfiguring robots are modular systems that can change shape, or reconfigure, to match structure to task. They comprise many small, discrete, often identical modules that connect together and that are minimally actuated. Global shape transformation is achieved by composing local motions. Systems with a single module type, known as homogeneous systems, gain fault tolerance, robustness and low production cost from module interchangeability. However, we are interested in heterogeneous systems, which include multiple types of modules such as those with sensors, batteries or wheels. We believe that heterogeneous systems offer the same benefits as homogeneous systems with the added ability to match not only structure to task, but also capability to task. Although significant results have been achieved in understanding homogeneous systems, research in heterogeneous systems is challenging as key algorithmic issues remain unexplored. We propose in this thesis to investigate questions in four main areas: 1) how to classify heterogeneous systems, 2) how to develop efficient heterogeneous reconfiguration algorithms with desired characteristics, 3) how to characterize the complexity of key algorithmic problems, and 4) how to apply these heterogeneous algorithms to perform useful new tasks in simulation and in the physical world. Our goal is to develop an algorithmic basis for heterogeneous systems. This has theoretical significance in that it addresses a major open problem in the field, and practical significance in providing self-reconfiguring robots with increased capabilities

Heterogeneous Self-Reconfiguring Robotics

Self-reconfiguring (SR) robots are modular systems that can autonomously change shape, or reconfigure, for increased versatility and adaptability in unknown environments. In this thesis, we investigate planning and control for systems of non-identical modules, known as heterogeneous SR robots. Although previous approaches rely on module homogeneity as a critical property, we show that the planning complexity of fundamental algorithmic problems in the heterogeneous case is equivalent to that of systems with identical modules. Primarily, we study the problem of how to plan shape changes while considering the placement of specific modules within the structure. We characterize this key challenge in terms of the amount of free space available to the robot and develop a series of decentralized reconfiguration planning algorithms that assume progressively more severe free space constraints and support reconfiguration among obstacles. In addition, we compose our basic planning techniques in different ways to address problems in the related task domains of positioning modules according to function, locomotion among obstacles, self-repair, and recognizing the achievement of distributed goal-states. We also describe the design of a novel simulation environment, implementation results using this simulator, and experimental results in hardware using a planar SR system called the Crystal Robot. These results encourage development of heterogeneous systems. Our algorithms enhance the versatility and adaptability of SR robots by enabling them to use functionally specialized components to match capability, in addition to shape, to the task at hand

Collective Construction of 2D Block Structures with Holes

In this paper we present algorithms for collective construction systems in which a large number of autonomous mobile robots trans- port modular building elements to construct a desired structure. We focus on building block structures subject to some physical constraints that restrict the order in which the blocks may be attached to the structure. Specifically, we determine a partial ordering on the blocks such that if they are attached in accordance with this ordering, then (i) the structure is a single, connected piece at all intermediate stages of construction, and (ii) no block is attached between two other previously attached blocks, since such a space is too narrow for a robot to maneuver a block into it. Previous work has consider this problem for building 2D structures without holes. Here we extend this work to 2D structures with holes. We accomplish this by modeling the problem as a graph orientation problem and describe an O(n^2) algorithm for solving it. We also describe how this partial ordering may be used in a distributed fashion by the robots to coordinate their actions during the building process.Comment: 13 pages, 3 figure

Reconfiguring Non-Convex Holes in Pivoting Modular Cube Robots

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 the surface of configurations by pivoting about shared edges, enabling configurations to reshape themselves. Previous work provides a reconfiguration algorithm for admissible 3D configurations containing no non-convex holes; we improve upon this by handling arbitrary admissible 3D configurations. The key insight specifies a point in the deconstruction of layers enclosing non-convex holes at which we can pause and move inner modules out of the hole. We prove this happens early enough to maintain connectivity, but late enough to open enough room in the enclosing layer for modules to escape the hole. Our algorithm gives reconfiguration plans with O(n^2) moves for n modules

Autonomous Task-Based Evolutionary Design of Modular Robots

In an attempt to solve the problem of finding a set of multiple unique modular robotic designs that can be constructed using a given repertoire of modules to perform a specific task, a novel synthesis framework is introduced based on design optimization concepts and evolutionary algorithms to search for the optimal design. Designing modular robotic systems faces two main challenges: the lack of basic rules of thumb and design bias introduced by human designers. The space of possible designs cannot be easily grasped by human designers especially for new tasks or tasks that are not fully understood by designers. Therefore, evolutionary computation is employed to design modular robots autonomously. Evolutionary algorithms can efficiently handle problems with discrete search spaces and solutions of variable sizes as these algorithms offer feasible robustness to local minima in the search space; and they can be parallelized easily to reducing system runtime. Moreover, they do not have to make assumptions about the solution form. This dissertation proposes a novel autonomous system for task-based modular robotic design based on evolutionary algorithms to search for the optimal design. The introduced system offers a flexible synthesis algorithm that can accommodate to different task-based design needs and can be applied to different modular shapes to produce homogenous modular robots. The proposed system uses a new representation for modular robotic assembly configuration based on graph theory and Assembly Incidence Matrix (AIM), in order to enable efficient and extendible task-based design of modular robots that can take input modules of different geometries and Degrees Of Freedom (DOFs). Robotic simulation is a powerful tool for saving time and money when designing robots as it provides an accurate method of assessing robotic adequacy to accomplish a specific task. Furthermore, it is difficult to predict robotic performance without simulation. Thus, simulation is used in this research to evaluate the robotic designs by measuring the fitness of the evolved robots, while incorporating the environmental features and robotic hardware constraints. Results are illustrated for a number of benchmark problems. The results presented a significant advance in robotic design automation state of the art

Evolutionary Modular Robotics: Survey and Analysis

This paper surveys various applications of artificial evolution in the field of modular robots. Evolutionary robotics aims to design autonomous adaptive robots automatically that can evolve to accomplish a specific task while adapting to environmental changes. A number of studies have demonstrated the feasibility of evolutionary algorithms for generating robotic control and morphology. However, a huge challenge faced was how to manufacture these robots. Therefore, modular robots were employed to simplify robotic evolution and their implementation in real hardware. Consequently, more research work has emerged on using evolutionary computation to design modular robots rather than using traditional hand design approaches in order to avoid cognition bias. These techniques have the potential of developing adaptive robots that can achieve tasks not fully understood by human designers. Furthermore, evolutionary algorithms were studied to generate global modular robotic behaviors including; self-assembly, self-reconfiguration, self-repair, and self-reproduction. These characteristics allow modular robots to explore unstructured and hazardous environments. In order to accomplish the aforementioned evolutionary modular robotic promises, this paper reviews current research on evolutionary robotics and modular robots. The motivation behind this work is to identify the most promising methods that can lead to developing autonomous adaptive robotic systems that require the minimum task related knowledge on the designer side.https://doi.org/10.1007/s10846-018-0902-

Systematic strategies for 3-dimensional modular robots

Modular robots have been studied an classified from different perspectives, generally focusing on the mechatronics. But the geometric attributes and constraints are the ones that determine the self-reconfiguration strategies. In two dimensions, robots can be geometrically classified by the grid in which their units are arranged and the free cells required to move a unit to an edge-adjacent or vertex-adjacent cell. Since a similar analysis does not exist in three dimensions, we present here a systematic study of the geometric aspects of three-dimensional modular robots. We find relations among the different designs but there are no general models, except from the pivoting cube one, that lead to deterministic reconfiguration plans. In general the motion capabilities of a single module are very limited and its motion constraints are not simple. A widely used method for reducing the complexity and improving the speed of reconfiguration plans is the use of meta-modules. We present a robust and compact meta-module of M-TRAN and other similar robots that is able to perform the expand/contract operations of the Telecube units, for which efficient reconfiguration is possible. Our meta-modules also perform the scrunch/relax and transfer operations of Telecube meta-modules required by the known reconfiguration algorithms. These reduction proofs make it possible to apply efficient geometric reconfiguration algorithms to this type of robots