Self-assembly of modular robotic systems enables the construction complex configurations to adapt different tasks. This paper presents a framework for SMORES types robots efficiently self-assemble into tree topologies. These form kinematic chains that have been shown be capable large variety manipulation and locomotion tasks, yet they can reconfigure using mobile reconfiguration. A desired topo...

Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, including hybridization/ligation and mix/split methods. Here, we implement and compare parallel overlap assembly with the hybridization/ligation method. We applied these methods to the molecular algorithm to solve an insta...

The Black & Decker factory in Easton, Maryland, uses parallel, off-line assembly lines to produce multiple models in small, infrequent production runs. The University of Maryland and Black & Decker have implemented an Internet-based work instructions system that supports parallel, off-line assembly. Black & Decker personnel create and update easy-to-read paperless work instructions, and each as...

We introduce a model of self-assembly P systems as devices that use some of the features of population P systems to progressively grow a graph structure by forming new bonds between the existing cells and some new cells which are brought into the system step by step. The new cells are then able to self-assemble locally either at the level of cells or at the level of neighbourhoods of cells by u...

We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The gene assembly, based on three types of operations only, is then modeled as a graph reduction process (to the empty graph). Motivated by the robustness of the gene assembly process, the notions of parallel reduction and p...