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-

A Vision-based Scheme for Kinematic Model Construction of Re-configurable Modular Robots

Re-configurable modular robotic (RMR) systems are advantageous for their reconfigurability and versatility. A new modular robot can be built for a specific task by using modules as building blocks. However, constructing a kinematic model for a newly conceived robot requires significant work. Due to the finite size of module-types, models of all module-types can be built individually and stored in a database beforehand. With this priori knowledge, the model construction process can be automated by detecting the modules and their corresponding interconnections. Previous literature proposed theoretical frameworks for constructing kinematic models of modular robots, assuming that such information was known a priori. While well-devised mechanisms and built-in sensors can be employed to detect these parameters automatically, they significantly complicate the module design and thus are expensive. In this paper, we propose a vision-based method to identify kinematic chains and automatically construct robot models for modular robots. Each module is affixed with augmented reality (AR) tags that are encoded with unique IDs. An image of a modular robot is taken and the detected modules are recognized by querying a database that maintains all module information. The poses of detected modules are used to compute: (i) the connection between modules and (ii) joint angles of joint-modules. Finally, the robot serial-link chain is identified and the kinematic model constructed and visualized. Our experimental results validate the effectiveness of our approach. While implementation with only our RMR is shown, our method can be applied to other RMRs where self-identification is not possible

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

A Two Dimensional Crystalline Atomic Unit Modular Self-reconfigurable Robot

Self-reconfigurable robots are designed so that they can change their external shape without human intervention. One general way to achieve such functionality is to build a robot composed of multiple, identical unit modules. If the modules are designed so that they can be assembled into rigid structures, and so that individual units within such structures can be relocated within and about the structure, then self-reconfiguration is possible. We propose the Crystalline Atomic unit modular self-reconfigurable robot, where each unit is called an Atom. In two dimensions, an Atom is square. Connectors at the faces of each Atom support structure formation (such structures are called Crystals). Centrally placed prismatic degrees of freedom give Atoms the ability to contract their outer side-length by a constant factor. By contracting and expanding groups of Atoms in a coordinated way, Atoms can relocate within and about Crystals. Thus Atoms are shown to satisfy the two properties necessary to function as modules of a self-reconfigurable robot. A powerful software simulator for Crystalline Atomic robots in two and three dimensions, called xtalsim, is presented. Xtalsim includes a high-level language interface for specifying reconfigurations, an engine which expands implicit reconfiguration plans into explicit Crystal state sequences, and an interactive animator which displays the results in a virtual environment. An automated planning algorithm for generating reconfigurations, called the Melt-Grow planner, is described. The Melt-Grow planner is fast (O(n2) for Crystals of n Atoms) and complete for a fully general subset of Crystals. The Melt-Grow planner is implemented and interfaced to xtalsim, and an automatically planned reconfiguration is simulated. Finally, the mechanics, electronics, and software for an Atom implementation are developed. Two Atoms are constructed and experiments are performed which indicate that, with some hardware improvements, an interesting self-reconfiguration could be demonstrated by a group of Atoms

A Rapidly Reconfigurable Robotics Workcell and Its Applictions for Tissue Engineering

This article describes the development of a component-based technology robot system that can be rapidly configured to perform a specific manufacturing task. The system is conceived with standard and inter-operable components including actuator modules, rigid link connectors and tools that can be assembled into robots with arbitrary geometry and degrees of freedom. The reconfigurable "plug-and-play" robot kinematic and dynamic modeling algorithms are developed. These algorithms are the basis for the control and simulation of reconfigurable robots. The concept of robot configuration optimization is introduced for the effective use of the rapidly reconfigurable robots. Control and communications of the workcell components are facilitated by a workcell-wide TCP/IP network and device level CAN-bus networks. An object-oriented simulation and visualization software for the reconfigurable robot is developed based on Windows NT. Prototypes of the robot systems configured to perform 3D contour following task and the positioning task are constructed and demonstrated. Applications of such systems for biomedical tissue scaffold fabrication are considered.Singapore-MIT Alliance (SMA

Addressing Tasks Through Robot Adaptation

Developing flexible, broadly capable systems is essential for robots to move out of factories and into our daily lives, functioning as responsive agents that can handle whatever the world throws at them. This dissertation focuses on two kinds of robot adaptation. Modular self-reconfigurable robots (MSRR) adapt to the requirements of their task and environments by transforming themselves. By rearranging the connective structure of their component robot modules, these systems can assume different morphologies: for example, a cluster of modules might configure themselves into a car to maneuver on flat ground, a snake to climb stairs, or an arm to pick and place objects. Conversely, environment augmentation is a strategy in which the robot transforms its environment to meet its own needs, adding physical structures that allow it to overcome obstacles. In both areas, the presented work includes elements of hardware design, algorithms, and integrated systems, with the common goal of establishing these methods of adaptation as viable strategies to address tasks. The research takes a systems-level view of robotics, placing particular emphasis on experimental validation in hardware

Distributed reinforcement learning for self-reconfiguring modular robots

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Includes bibliographical references (p. 101-106).In this thesis, we study distributed reinforcement learning in the context of automating the design of decentralized control for groups of cooperating, coupled robots. Specifically, we develop a framework and algorithms for automatically generating distributed controllers for self-reconfiguring modular robots using reinforcement learning. The promise of self-reconfiguring modular robots is that of robustness, adaptability and versatility. Yet most state-of-the-art distributed controllers are laboriously handcrafted and task-specific, due to the inherent complexities of distributed, local-only control. In this thesis, we propose and develop a framework for using reinforcement learning for automatic generation of such controllers. The approach is profitable because reinforcement learning methods search for good behaviors during the lifetime of the learning agent, and are therefore applicable to online adaptation as well as automatic controller design. However, we must overcome the challenges due to the fundamental partial observability inherent in a distributed system such as a self reconfiguring modular robot. We use a family of policy search methods that we adapt to our distributed problem. The outcome of a local search is always influenced by the search space dimensionality, its starting point, and the amount and quality of available exploration through experience.(cont) We undertake a systematic study of the effects that certain robot and task parameters, such as the number of modules, presence of exploration constraints, availability of nearest-neighbor communications, and partial behavioral knowledge from previous experience, have on the speed and reliability of learning through policy search in self-reconfiguring modular robots. In the process, we develop novel algorithmic variations and compact search space representations for learning in our domain, which we test experimentally on a number of tasks. This thesis is an empirical study of reinforcement learning in a simulated lattice based self-reconfiguring modular robot domain. However, our results contribute to the broader understanding of automatic generation of group control and design of distributed reinforcement learning algorithms.by Paulina Varshavskaya.Ph.D