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

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

Heterogeneous Self-Reconfiguring Robotics

Self-reconfiguring (SR) robots are modular systems that can autonomously change shape, or reconfigure, for increased versatility and adaptability in unknown environments. In this thesis, we investigate planning and control for systems of non-identical modules, known as heterogeneous SR robots. Although previous approaches rely on module homogeneity as a critical property, we show that the planning complexity of fundamental algorithmic problems in the heterogeneous case is equivalent to that of systems with identical modules. Primarily, we study the problem of how to plan shape changes while considering the placement of specific modules within the structure. We characterize this key challenge in terms of the amount of free space available to the robot and develop a series of decentralized reconfiguration planning algorithms that assume progressively more severe free space constraints and support reconfiguration among obstacles. In addition, we compose our basic planning techniques in different ways to address problems in the related task domains of positioning modules according to function, locomotion among obstacles, self-repair, and recognizing the achievement of distributed goal-states. We also describe the design of a novel simulation environment, implementation results using this simulator, and experimental results in hardware using a planar SR system called the Crystal Robot. These results encourage development of heterogeneous systems. Our algorithms enhance the versatility and adaptability of SR robots by enabling them to use functionally specialized components to match capability, in addition to shape, to the task at hand

Robotics for Natural Orifice Transluminal Endoscopic Surgery: A Review

Natural Orifice Transluminal Endoscopic Surgery (NOTES) involves accessing the abdominal cavity via one of the bodies’ natural orifices, for example, mouth, anus, or vagina. This new surgical procedure is very appealing from patients’ perspectives because it eliminates completely abdominal wall aggression and promises to reduce postoperative pain, in addition to all other advantages brought by laparoscopic surgery. However, the constraints imposed by both the mode of access and the limited technology currently available make NOTES very challenging for the surgeons. Redesign of the instruments is imperative in order to make this emerging operative access safe and reproducible. In this paper, we survey on the state-of-the-art devices used in NOTES and introduce both the flexible instruments based on improvement of current endoscopic platforms and the revolutionary concept of robotic platforms based on the convergence of communication and micromechatronics technologies. The advantages and limitations of each category are addressed. Potential solutions are proposed to improve the existing designs and develop robust and stable robotic platforms for NOTES

Characterisation of a nuclear cave environment utilising an autonomous swarm of heterogeneous robots

As nuclear facilities come to the end of their operational lifetime, safe decommissioning becomes a more prevalent issue. In many such facilities there exist ‘nuclear caves’. These caves constitute areas that may have been entered infrequently, or even not at all, since the construction of the facility. Due to this, the topography and nature of the contents of these nuclear caves may be unknown in a number of critical aspects, such as the location of dangerous substances or significant physical blockages to movement around the cave. In order to aid safe decommissioning, autonomous robotic systems capable of characterising nuclear cave environments are desired. The research put forward in this thesis seeks to answer the question: is it possible to utilise a heterogeneous swarm of autonomous robots for the remote characterisation of a nuclear cave environment? This is achieved through examination of the three key components comprising a heterogeneous swarm: sensing, locomotion and control. It will be shown that a heterogeneous swarm is not only capable of performing this task, it is preferable to a homogeneous swarm. This is due to the increased sensory and locomotive capabilities, coupled with more efficient explorational prowess when compared to a homogeneous swarm

Formation and organisation in robot swarms.

A swarm is defined as a large and independent collection of heterogeneous or homogeneous agents operating in a common environment and seemingly acting in a coherent and coordinated manner. Swarm architectures promote decentralisation and self-organisation which often leads to emergent behaviour. The emergent behaviour of the swarm results from the interactions of the swarm with its environment (or fellow agents), but not as a direct result of design. The creation of artificially simulated swarms or practical robot swarms has become an interesting topic of research in the last decade. Even though many studies have been undertaken using a practical approach to swarm construction, there are still many problems need to be addressed. Such problems include the problem of how to control very simple agents to form patterns; the problem of how an attractor will affect flocking behaviour; and the problem of bridging formation of multiple agents in connecting multiple locations. The central goal of this thesis is to develop early novel theories and algorithms to support swarm robots in. pattern formation tasks. To achieve this, appropriate tools for understanding how to model, design and control individual units have to be developed. This thesis consists of three independent pieces of research work that address the problem of pattern formation of robot swarms in both a centralised and a decentralised way.The first research contribution proposes algorithms of line formation and cluster formation in a decentralised way for relatively simple homogenous agents with very little memory, limited sensing capabilities and processing power. This research utilises the Finite State Machine approach.In the second research contribution, by extending Wilensky's (1999) work on flocking, three different movement models are modelled by changing the maximum viewing angle each agent possesses during the course of changing its direction. An object which releases an artificial potential field is then introduced in the centre of the arena and the behaviours of the collective movement model are studied.The third research contribution studies the complex formation of agents in a task that requires a formation of agents between two locations. This novel research proposes the use Of L-Systems that are evolved using genetic algorithms so that more complex pattern formations can be represented and achieved. Agents will need to have the ability to interpret short strings of rules that form the basic DNA of the formation

Theory of Self-maintaining Robots

This thesis proposes a theory for robotic systems that can be fully self-maintaining. The presented design principles focus on functional survival of the robots over long periods of time without human maintenance. Self-maintaining semi-autonomous mobile robots are in great demand in nuclear disposal sites from where their removal for maintenance is undesirable due to their radioactive contamination. Similar are requirements for robots in various defence tasks or space missions. For optimal design, modular solutions are balanced against capabilities to replace smaller components in a robot by itself or by help from another robot. Modules are proposed for the basic platform, which enable self-maintenance within a team of robots helping each other. The primary method of self-maintenance is replacement of malfunctioning modules or components by the robots themselves. Replacement necessitates a robot team’s ability to diagnose and replace malfunctioning modules as needed. Due to their design, these robots still remain manually re-configurable if opportunity arises for human intervention. A system reliability model is developed to describe the new theory. Depending on the system reliability model, the redundancy allocation problem is presented and solved by a multi objective algorithm. Finally, the thesis introduces the self-maintaining process and transfers it to a multi robot task allocation problem with a solution by genetic algorithm

DESIGNING A MULTI-AGENT FRAMEWORK FOR UNMANNED AERIAL/GROUND VEHICLES

Ph.DDOCTOR OF PHILOSOPH