Shape formation by self-disassembly in programmable matter systems

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.Cataloged from PDF version of thesis.Includes bibliographical references (p. 225-236).Programmable matter systems are composed of small, intelligent modules able to form a variety of macroscale objects with specific material properties in response to external commands or stimuli. While many programmable matter systems have been proposed in fiction, (Barbapapa, Changelings from Star Trek, the Terminator, and Transformers), and academia, a lack of suitable hardware and accompanying algorithms prevents their full realization. With this thesis research, we aim to create a system of miniature modules that can form arbitrary structures on demand. We develop autonomous 12mm cubic modules capable of bonding to, and communicating with, four of their immediate neighbors. These modules are among the smallest autonomous modular robots capable of sensing, communication, computation, and actuation. The modules employ unique electropermanent magnet connectors. The four connectors in each module enable the modules to communicate and share power with their nearest neighbors. These solid-state connectors are strong enough for a single inter-module connection to support the weight of 80 other modules. The connectors only consume power when switching on or off; they have no static power consumption. We implement a number of low-level communication and control algorithms which manage information transfer between neighboring modules. These algorithms ensure that messages are delivered reliably despite challenging conditions. They monitor the state of all communication links and are able to reroute messages around broken communication links to ensure that they reach their intended destinations. In order to accomplish our long-standing goal of programmatic shape formation, we also develop a suite of provably-correct distributed algorithms that allow complex shape formation. The distributed duplication algorithm that we present allows the system to duplicate any passive object that is submerged in a collection of programmable matter modules. The algorithm runs on the processors inside the modules and requires no external intervention. It requires 0(1) storage and O(n) inter-module messages per module, where n is the number of modules in the system. The algorithm can both magnify and produce multiple copies of the submerged object. A programmable matter system is a large network of autonomous processors, so these algorithms have applicability in a variety of routing, sensor network, and distributed computing applications. While our hardware system provides a 50-module test-bed for the algorithms, we show, by using a unique simulator, that the algorithms are capable of operating in much larger environments. Finally, we perform hundreds of experiments using both the simulator and hardware to show how the algorithms and hardware operate in practice.by Kyle William Gilpin.Ph.D

Technology 2000, volume 1

The purpose of the conference was to increase awareness of existing NASA developed technologies that are available for immediate use in the development of new products and processes, and to lay the groundwork for the effective utilization of emerging technologies. There were sessions on the following: Computer technology and software engineering; Human factors engineering and life sciences; Information and data management; Material sciences; Manufacturing and fabrication technology; Power, energy, and control systems; Robotics; Sensors and measurement technology; Artificial intelligence; Environmental technology; Optics and communications; and Superconductivity

The Red Rover Algorithm for Deadlock-Free Routing on Bidirectional Rings

An algorithm for deadlock-free routing in bidirectional ring structures in multicomputer networks is presented. This algorithm provides greater throughput and lower message latencies than those of previously presented ring routing algorithms. Insight into these results is given by a message traffic analysis, and increased performance for wormhole-routed networks is quantified through simulation experiments. Additionally, a routing element which implements this algorithm is shown to be simpler and faster than that for a currently-used algorithm. Keywords: Multicomputer Networks, Routing, Virtual Channels 1 Introduction First generation distributed-memory multicomputers such as the Cosmic Cube [10] used "store-and-forward" packet-switching methods for routing messages among the multicomputer nodes. The present generation of multicomputers is able to reduce hardware communication overheads of first-generation machines by over two orders of magnitude by employing innovative routing techni..

Digital control networks for virtual creatures

Robot control systems evolved with genetic algorithms traditionally take the form of floating-point neural network models. This thesis proposes that digital control systems, such as quantised neural networks and logical networks, may also be used for the task of robot control. The inspiration for this is the observation that the dynamics of discrete networks may contain cyclic attractors which generate rhythmic behaviour, and that rhythmic behaviour underlies the central pattern generators which drive lowlevel motor activity in the biological world. To investigate this a series of experiments were carried out in a simulated physically realistic 3D world. The performance of evolved controllers was evaluated on two well known control tasks—pole balancing, and locomotion of evolved morphologies. The performance of evolved digital controllers was compared to evolved floating-point neural networks. The results show that the digital implementations are competitive with floating-point designs on both of the benchmark problems. In addition, the first reported evolution from scratch of a biped walker is presented, demonstrating that when all parameters are left open to evolutionary optimisation complex behaviour can result from simple components

First Annual Workshop on Space Operations Automation and Robotics (SOAR 87)

Several topics relative to automation and robotics technology are discussed. Automation of checkout, ground support, and logistics; automated software development; man-machine interfaces; neural networks; systems engineering and distributed/parallel processing architectures; and artificial intelligence/expert systems are among the topics covered

LIPIcs, Volume 251, ITCS 2023, Complete Volume

LIPIcs, Volume 251, ITCS 2023, Complete Volum