Studer, Gregory Michael (2011) Computing multi-scale organizations built through assembly. Doctoral thesis (DPhil), University of Sussex.
- Published Version
Download (6MB) | Preview
The ability to generate and control assembling structures built over many orders of magnitude is an unsolved challenge of engineering and science. Many of the presumed transformational benefits of nanotechnology and robotics are based directly on this capability. There are still significant theoretical difficulties associated with building such systems, though technology is rapidly ensuring that the tools needed are becoming available in chemical, electronic, and robotic domains. In this thesis a simulated, general-purpose computational prototype is developed which is capable of unlimited assembly and controlled by external input, as well as an additional prototype which, in structures, can emulate any other computing device. These devices are entirely finite-state and distributed in operation. Because of these properties and the unique ability to form unlimited size structures of unlimited computational power, the prototypes represent a novel and useful blueprint on which to base scalable assembly in other domains.
A new assembling model of Computational Organization and Regulation over Assembly Levels (CORAL) is also introduced, providing the necessary framework for this investigation. The strict constraints of the CORAL model allow only an assembling unit of a single type, distributed control, and ensure that units cannot be reprogrammed - all reprogramming is done via assembly. Multiple units are instead structured into aggregate computational devices using a procedural or developmental approach. Well-defined comparison of computational power between levels of organization is ensured by the structure of the model. By eliminating ambiguity, the CORAL model provides a pragmatic answer to open questions regarding a framework for hierarchical organization.
Finally, a comparison between the designed prototypes and units evolved using evolutionary algorithms is presented as a platform for further research into novel scalable assembly. Evolved units are capable of recursive pairing ability under the control of a signal, a primitive form of unlimited assembly, and do so via symmetry-breaking operations at each step. Heuristic evidence for a required minimal threshold of complexity is provided by the results, and challenges and limitations of the approach are identified for future evolutionary studies.
|Item Type:||Thesis (Doctoral)|
|Schools and Departments:||School of Engineering and Informatics > Informatics|
|Subjects:||T Technology > TA Engineering (General). Civil engineering (General) > TA0168 Systems engineering
T Technology > TJ Mechanical engineering and machinery > TJ0210.2 Mechanical devices and figures. Automata. Ingenious mechanisms. Robots (General)
|Depositing User:||Library Cataloguing|
|Date Deposited:||26 Sep 2011 08:29|
|Last Modified:||21 Aug 2015 11:42|