It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
This dissertation focuses on Robotic Self-Replication. The development of an autonomous self-replicating mobile robot that functions by undergoing stochastic motions is presented. An associated statistical analysis is presented to quantify the behavior of this system. The robot functions hierarchically. There are three stages in this hierarchy: (1) an initial pool of feed modules/parts together with one functional basic robot; (2) a collection of basic robots that spontaneously forms out of these parts as a result of a chain reaction induced by stochastic motion of the initial seed robot in stage 1; (3) complex formations of joined basic robots from stage 2.
In the first part we demonstrate basic stochastic self-replication in unstructured environments. A single functional robot moves around at random in a sea of stock modules and catalyzes the conversion of these modules into replicas. In the second part of the thesis, the robots are upgraded with a layer that enables mechanical connections between robots. The replicas can then connect to each other and aggregate. Robotic assembly for the replicas can take place through random, semi-random and programmable formations. The number of possible outcomes is studied.
Pseudo-dynamical and stochastic simulations are presented and compared with results from physical experiments. After verifying that the simulations produce the same results as the real experiments, we apply them to large populations to extrapolate how the behavior of real systems might scale.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer