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

System Design, Motion Modelling and Planning for a Recon figurable Wheeled Mobile Robot

Over the past ve decades the use of mobile robotic rovers to perform in-situ scienti c investigations on the surfaces of the Moon and Mars has been tremendously in uential in shaping our understanding of these extraterrestrial environments. As robotic missions have evolved there has been a greater desire to explore more unstructured terrain. This has exposed mobility limitations with conventional rover designs such as getting stuck in soft soil or simply not being able to access rugged terrain. Increased mobility and terrain traversability are key requirements when considering designs for next generation planetary rovers. Coupled with these requirements is the need to autonomously navigate unstructured terrain by taking full advantage of increased mobility. To address these issues, a high degree-of-freedom recon gurable platform that is capable of energy intensive legged locomotion in obstacle-rich terrain as well as wheeled locomotion in benign terrain is proposed. The complexities of the planning task that considers the high degree-of-freedom state space of this platform are considerable. A variant of asymptotically optimal sampling-based planners that exploits the presence of dominant sub-spaces within a recon gurable mobile robot's kinematic structure is proposed to increase path quality and ensure platform safety. The contributions of this thesis include: the design and implementation of a highly mobile planetary analogue rover; motion modelling of the platform to enable novel locomotion modes, along with experimental validation of each of these capabilities; the sampling-based HBFMT* planner that hierarchically considers sub-spaces to better guide search of the complete state space; and experimental validation of the planner with the physical platform that demonstrates how the planner exploits the robot's capabilities to uidly transition between various physical geometric con gurations and wheeled/legged locomotion modes

Reactive exploration with self-reconfigurable systems

Modular self-reconfigurable robots (MSR) are robots composed of modules that translate over one another to permit reconfiguration and locomotion. This construction allows them to traverse a broader range of environments than legged or wheeled robots. MSR also posses the ability to split apart to parallelize their efforts or combine with each other to produce a larger robot capable of navigating more diverse terrain. In this paper we discuss a state-based reactive architecture for the distributed control of cooperative MSR teams in unknown environments. The MSR use local sensory data from the environment and a model of the team to select their actions. These actions include selecting a destination, aborting a route to a destination, splitting into two separate robots, and combining with another robot. In simulation, team-configuration, environmental complexity, and behavioral parameters are varied to discern the most effective circumstances for the architecture and MSR. Our results show that the best configuration of the system is highly dependent on the environment

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

Towards Fault Diagnosis in Reconfigurable Robot

東京電機大学201

A Modular Robotic System with Applications to Space Exploration

Modular robotic systems offer potential advantages as versatile, fault-tolerant, cost-effective platforms for space exploration, but a sufficiently mature system is not yet available. We describe the possible applications of such a system, and present prototype hardware intended as a step in the right direction. We also present elements of an automated design and optimization framework aimed at making modular robots easier to design and use, and discuss the results of applying the system to a gait optimization problem. Finally, we discuss the potential near-term applications of modular robotics to terrestrial robotics research