231 research outputs found

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

    Get PDF
    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

    Optimal self assembly of modular manipulators with active and passive modules

    Get PDF
    Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.Includes bibliographical references (p. 89-92).In this thesis, we describe algorithms to build self-assembling robot systems composed of active modular robots and passive bars. The robotic module is the Shady3D robot and the passive component is a rigid bar with embedded IR LEDs. We propose algorithms that demonstrate the cooperative aggregation of modular robotic manipulators with greater capability and workspace out of these two types of elements. The distributed algorithms are based on locally optimal matching. We demonstrate how to build an active structure by the cooperative aggregation and disassembly of modular robotic manipulators. A target structure is modeled as a dynamic graph. We prove that the same optimality - quadratic competitive ratio - as for the static graph can be achieved for the algorithms. We demonstrate how this algorithm can be used to build truss-like structures. We present results from physical experiments in which two 3DOF Shady3D robots and one rigid bar coordinate to self-assemble into a 6DOF manipulator. We then demonstrate cooperative algorithms for forward and inverse kinematics, grasping, and mobility with this arm.by Seung-kook Yun.S.M

    Virtual articulation and kinematic abstraction in robotics

    Get PDF
    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.Cataloged from PDF version of thesis.Includes bibliographical references (p. 279-292).This thesis presents the theory, implementation, novel applications, and experimental validation of a general-purpose framework for applying virtual modifications to an articulated robot, or virtual articulations. These can homogenize various aspects of a robot and its task environment into a single unified model which is both qualitatively high-level and quantitatively functional. This is the first framework designed specifically for the mixed real/virtual case. It supports arbitrary topology spatial kinematics, a broad catalog of joints, on-line structure changes, interactive kinostatic simulation, and novel kinematic abstractions, where complex subsystems are simplified with virtual replacements in both space and time. Decomposition algorithms, including a novel method of hierarchical subdivision, enable scaling to large closed-chain mechanisms with 100s of joints. Novel applications are presented in two areas of current interest: operating high- DoF kinematic manipulation and inspection tasks, and analyzing reliable kinostatic locomotion strategies based on compliance and proprioception. In both areas virtual articulations homogeneously model the robot and its task environment, and abstractions structure complex models. For high-DoF operations the operator attaches virtual joints as a novel interface metaphor to define task motion and to constrain coordinated motion (by virtually closing kinematic chains); virtual links can represent task frames or serve as intermediate connections for virtual joints. For compliant locomotion, virtual articulations model relevant compliances and uncertainties, and temporal abstractions model contact state evolution.(cont.) Results are presented for experiments with two separate robotic systems in each area. For high-DoF operations, NASA/JPL's 36 DoF ATHLETE performs previously challenging coordinated manipulation/inspection moves, and a novel large-scale (100s of joints) simulated modular robot is conveniently operated using spatial abstractions. For compliant locomotion, two experiments are analyzed that each achieve high reliability in uncertain tasks using only compliance and proprioception: a novel vertical structure climbing robot that is 99.8% reliable in over 1000 motions, and a mini-humanoid that steps up an uncertain height with 90% reliability in 80 trials. In both cases virtual articulation models capture the essence of compliant/proprioceptive strategies at a higher level than basic physics, and enable quantitative analyses of the limits of tolerable uncertainty that compare well to experiment.by Marsette Arthur Vona, III.Ph.D

    Topological representation and analysis method for multi-port and multi-orientation docking modular robots

    Get PDF
    For MSR Robots to successfully configure from one configuration into another, the control system must be able to visualize the current structure of the robot, which cannot be done without appropriate information about each module's docking status. Although the type of information required to visualize the structure of a MSR robot differs with the physical design of the modules, there are essential information that are commonly required, such as docking orientation and identity of neighboring modules. This paper presents a novel multi-port and multi-orientation modular robot, and a representation method that can uniquely represent the geometric structure of a group of connected modules and to analyze the number of "reconfigurable DOF" within the structure. The proposed method uses labeled planar graphs and incidence matrices to describe the docking status of the modules within the structure, which helps to effectively encode the data in computer understandable expressions. In addition to the work in configuration analysis, an innovative mechanism for detecting the orientation of each docking port is also presented.published_or_final_versio

    Addressing Tasks Through Robot Adaptation

    Get PDF
    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

    Multiple chaotic central pattern generators with learning for legged locomotion and malfunction compensation

    Full text link
    An originally chaotic system can be controlled into various periodic dynamics. When it is implemented into a legged robot's locomotion control as a central pattern generator (CPG), sophisticated gait patterns arise so that the robot can perform various walking behaviors. However, such a single chaotic CPG controller has difficulties dealing with leg malfunction. Specifically, in the scenarios presented here, its movement permanently deviates from the desired trajectory. To address this problem, we extend the single chaotic CPG to multiple CPGs with learning. The learning mechanism is based on a simulated annealing algorithm. In a normal situation, the CPGs synchronize and their dynamics are identical. With leg malfunction or disability, the CPGs lose synchronization leading to independent dynamics. In this case, the learning mechanism is applied to automatically adjust the remaining legs' oscillation frequencies so that the robot adapts its locomotion to deal with the malfunction. As a consequence, the trajectory produced by the multiple chaotic CPGs resembles the original trajectory far better than the one produced by only a single CPG. The performance of the system is evaluated first in a physical simulation of a quadruped as well as a hexapod robot and finally in a real six-legged walking machine called AMOSII. The experimental results presented here reveal that using multiple CPGs with learning is an effective approach for adaptive locomotion generation where, for instance, different body parts have to perform independent movements for malfunction compensation.Comment: 48 pages, 16 figures, Information Sciences 201
    corecore