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-

TOWARDS A NOVEL RESILIENT ROBOTIC SYSTEM

Resilient robotic systems are a kind of robotic system that is able to recover their original function after partial damage of the system. This is achieved by making changes on the partially damaged robot. In this dissertation study, a general robot, which makes sense by including active joints, passive joints, passive links, and passive adjustable links, was proposed in order to explore its resilience. Note that such a robot is also called an under-actuated robot. This dissertation presents the following studies. First, a novel architecture of robots was proposed, which is characterized as under-actuated robot. The architecture enables three types of recovery strategy, namely (1) change of the robot behavior, (2) change of the robot state, and (3) change of the robot configuration. Second, a novel docking system was developed, which allows for the realization of real-time assembly and disassembly and passive joint and adjustable passive link, and this thus enables the realization of the proposed architecture. Third, an example prototype system was built to experiment the effectiveness of the proposed architecture and to demonstrate the resilient behavior of the robot. Fourth, a novel method for robot configuration synthesis was developed, which is based on the genetic algorithm (GA), to determine the goal configuration of a partially damaged robot, at which the robot can still perform its original function. The novelty of the method lies in the integration of both discrete variables such as the number of modules, type of modules, and assembly patterns between modules and the continuous variables such as the length of modules and initial location of the robot. Fifth, a GA-based method for robot reconfiguration planning and scheduling was developed to actually change the robot from its initial configuration to the goal configuration with a minimum effort (time and energy). Two conclusions can be drawn from the above studies. First, the under-actuated robotic architecture can build a cost effective robot that can achieve the highest degree of resilience. Second, the design of the under-actuated resilient robot with the proposed docking system not only reduces the cost but also overcomes the two common actuator failures: (i) an active joint is unlocked (thus becoming a passive joint) and (ii) an active joint is locked (thus becoming an adjustable link). There are several contributions made by this dissertation to the field of robotics. The first is the finding that an under-actuated robot can be made more resilient. In the field of robotics, the concept of the under-actuated robot is available, but it has not been considered for reconfiguration (in literature, the reconfiguration is mostly about fully actuated robots). The second is the elaboration on the concept of reconfiguration planning, scheduling, and manipulation/control. In the literature of robotics, only the concept of reconfiguration planning is precisely given but not for reconfiguration scheduling. The third is the development of the model along with its algorithm for synthesis of the goal reconfiguration, reconfiguration planning, and scheduling. The application of the proposed under-actuated resilient robot lies in the operations in unknown or dangerous environments, for example, in rescue missions and space explorations. In these applications, replacement or repair of a damaged robot is impossible or cost-prohibited

3D reconfiguration using graph grammars for modular robotics

The objective of this thesis is to develop a method for the reconfiguration of three-dimensional modular robots. A modular robot is composed of simple individual building blocks or modules. Each of these modules needs to be controlled and actuated individually in order to make the robot perform useful tasks. The presented method allows us to reconfigure arbitrary initial configurations of modules into any pre-specified target configuration by using graph grammar rules that rely on local information only. Local in a sense that each module needs just information from neighboring modules in order to decide its next reconfiguration step. The advantage of this approach is that the modules do not need global knowledge about the whole configuration. We propose a two stage reconfiguration process composed of a centralized planning stage and a decentralized, rule-based reconfiguration stage. In the first stage, paths are planned for each module and then rewritten into a ruleset, also called a graph grammar. Global knowledge about the configuration is available to the planner. In stage two, these rules are applied in a decentralized fashion by each node individually and with local knowledge only. Each module can check the ruleset for applicable rules in parallel. This approach has been implemented in Matlab and currently, we are able to generate rulesets for arbitrary homogeneous input configurations.MSCommittee Chair: Magnus Egerstedt; Committee Member: Jeff Shamma; Committee Member: Patricio Antonio Vel

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

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

SUPERBOT: A Deployable, Multi-Functional, and Modular Self-Reconfigurable Robotic System

Abstract – Self-reconfigurable robots are modular robots that can autonomously change their shape and size to meet specific operational demands. Recently, there has been a great interest in using self-reconfigurable robots in applications such as reconnaissance, rescue missions, and space applications. Designing and controlling self-reconfigurable robots is a difficult task. Hence, the research has primarily been focused on developing systems that can function in a controlled environment. This paper presents a novel self-reconfigurable robotic system called SuperBot, which addresses the challenges of building and controlling deployable self-reconfigurable robots. Six prototype modules have been built and preliminary experimental results demonstrate that SuperBot is a flexible and powerful system that can be used in challenging realworld applications

A Proposal for a Multi-Drive Heterogeneous Modular Pipe- Inspection Micro-Robot

This paper presents the architecture used to develop a micro-robot for narrow pipes inspection. Both the electromechanical design and the control scheme will be described. In pipe environments it is very useful to have a method to retrieve information of the state of the inside part of the pipes in order to detect damages, breaks and holes. Due to the di_erent types of pipes that exists, a modular approach with di_erent types of modules has been chosen in order to be able to adapt to the shape of the pipe and to chose the most appropriate gait. The micro-robot has been designed for narrow pipes, a _eld in which there are not many prototypes. The robot incorporates a camera module for visual inspection and several drive modules for locomotion and turn (helicoidal, inchworm, two degrees of freedom rotation). The control scheme is based on semi-distributed behavior control and is also described. A simulation environment is also presented for prototypes testing