Spatio-Temporal Patterns act as Computational Mechanisms governing Emergent behavior in Robotic Swarms

open access articleOur goal is to control a robotic swarm without removing its swarm-like nature. In other words, we aim to intrinsically control a robotic swarm emergent behavior. Past attempts at governing robotic swarms or their selfcoordinating emergent behavior, has proven ineffective, largely due to the swarm’s inherent randomness (making it difficult to predict) and utter simplicity (they lack a leader, any kind of centralized control, long-range communication, global knowledge, complex internal models and only operate on a couple of basic, reactive rules). The main problem is that emergent phenomena itself is not fully understood, despite being at the forefront of current research. Research into 1D and 2D Cellular Automata has uncovered a hidden computational layer which bridges the micromacro gap (i.e., how individual behaviors at the micro-level influence the global behaviors on the macro-level). We hypothesize that there also lie embedded computational mechanisms at the heart of a robotic swarm’s emergent behavior. To test this theory, we proceeded to simulate robotic swarms (represented as both particles and dynamic networks) and then designed local rules to induce various types of intelligent, emergent behaviors (as well as designing genetic algorithms to evolve robotic swarms with emergent behaviors). Finally, we analysed these robotic swarms and successfully confirmed our hypothesis; analyzing their developments and interactions over time revealed various forms of embedded spatiotemporal patterns which store, propagate and parallel process information across the swarm according to some internal, collision-based logic (solving the mystery of how simple robots are able to self-coordinate and allow global behaviors to emerge across the swarm)

Artificial Intelligence Applications for Drones Navigation in GPS-denied or degraded Environments

L'abstract è presente nell'allegato / the abstract is in the attachmen

GUARDIANS final report

Emergencies in industrial warehouses are a major concern for firefghters. The large dimensions together with the development of dense smoke that drastically reduces visibility, represent major challenges. The Guardians robot swarm is designed to assist fire fighters in searching a large warehouse. In this report we discuss the technology developed for a swarm of robots searching and assisting fire fighters. We explain the swarming algorithms which provide the functionality by which the robots react to and follow humans while no communication is required. Next we discuss the wireless communication system, which is a so-called mobile ad-hoc network. The communication network provides also one of the means to locate the robots and humans. Thus the robot swarm is able to locate itself and provide guidance information to the humans. Together with the re ghters we explored how the robot swarm should feed information back to the human fire fighter. We have designed and experimented with interfaces for presenting swarm based information to human beings

GUARDIANS final report part 1 (draft): a robot swarm assisting a human fire fighter

Emergencies in industrial warehouses are a major concern for fire fighters. The large dimensions together with the development of dense smoke that drastically reduces visibility, represent major challenges. The Guardians robot swarm is designed to assist re ghters in searching a large warehouse. In this paper we discuss the technology developed for a swarm of robots assisting re ghters. We explain the swarming algorithms which provide the functionality by which the robots react to and follow humans while no communication is required. Next we discuss the wireless communication system, which is a so-called mobile ad-hoc network. The communication network provides also the means to locate the robots and humans. Thus the robot swarm is able to provide guidance information to the humans. Together with the fire fighters we explored how the robot swarm should feed information back to the human fire fighter. We have designed and experimented with interfaces for presenting swarm based information to human beings

Reactive Particle Swarm Control Architecture and Application for Scalar Field Adaptive Navigation

Adaptive navigation is a subcategory of navigation techniques that attempts to identify goal locations that satisfy specific criteria in an unknown area. In 2D scalar field adaptive navigation (SFAN), primitives navigate to or along features of interest in an unknown, possibly time-varying, planar scalar field. Features include extrema, contours, and fronts. This work solves the 2D SFAN problem using swarm robotic techniques. Robotic swarms are a subset of multi-robot systems that use decentralized control of simple interchangeable robots to perform collective actions. A subgroup of swarms is the Reactive Particle Swarm (RPS), characterized based on its simplicity, reactivity to its current environment, and flexibility of applications. Previous work in RPS lacks a unified implementation for RPS behaviors making cross-comparison and reuse challenging. This work presents a novel 1) RPS control architecture that streamlines the development of novel RPS behaviors, 2) elliptical aggregation algorithm that meets the four tenets of elliptical aggregation, and 3) series of 2D RPS SFAN primitives, and verifies all RPS base and composite behaviors using simulated and hardware-in-the-loop case studies. The architecture unifies the development of new RPS behaviors. The weighted summation of simple base behaviors and external command inputs form complex composite behaviors. This plug-and-play design concept allows for the rapid development of novel combinations of base behaviors, and emphasizes the topdown design of composite behaviors. A series of simulated and on-hardware case studies demonstrate the utility and flexibility of the architecture while establishing a library of verified RPS base behaviors. The four tenets of elliptical aggregation are 1) guidelines for swarm and ellipse parameter selection to ensure successful aggregation, 2) commandable ellipse parameters, 3) simplicity for scaling in the number of robots, and 4) adaptive sizing. The elliptical attraction behavior can be leveraged for SFAN to orient the swarm to improve feature sensing and size to overcome noise thresholds. The elliptical attraction behavior and adaptive sizing variant were verified using simulated and experimental trials. For 2D RPS SFAN primitives, the extremum seeking, contour following, and front identification behaviors and their adaptive sizing variants are verified using simulations incorporating both artificial and interpolated real-world scalar fields and hardware-in-the-loop trials. The ridge descent, trench ascent, and saddle point identification behaviors are presented in a preliminary form and are verified through simulation. Overall this work has four main contributions, 1) a novel RPS control architecture that unifies the implementation and streamlines the development of novel RPS behaviors, 2) a novel elliptical attraction behavior, 3) novel SFAN primitives, and 4) verification of all RPS behaviors through simulation and hardware-in-theloop trials

Training Single Walled Carbon Nanotube based Materials to perform computation

This thesis illustrates the use of Single Walled Carbon Nanotube based materials for the solution of various computational problems by using the process of computer controlled evolution. The study aims to explore and identify three dimensions of a form of unconventional computing called, `Evolution-in-materio'. First, it focuses on identifying suitable materials for computation. Second, it explores suitable methods, i.e. optimisation and evolutionary algorithms to train these materials to perform computation. And third, it aims to identify suitable computational problems to test with these materials. Different carbon based materials, mainly single walled carbon nano-tubes with their varying concentrations in polymers have been studied to be trained for different computational problems using the principal of `evolution-in-materio'. The conductive property of the materials is used to train these materials to perform some meaningful computation. The training process is formulated as an optimisation problem with hardware in loop. It involves the application of an external stimuli (voltages) on the material which brings changes in its electrical properties. In order to train the material for a specific computational problem, a large number of configuration signals need to be tested to find the one that transforms the incident signal in such a way that a meaningful computation can be extracted from the material. An evolutionary algorithm is used to identify this configuration data and using a hardware platform, this data is transformed into incident signals. Depending on the computational problem, the specific voltages signals when applied at specific points on to the material, as identified by an evolutionary algorithm, can make the material behave as a Logic gate, a tone discriminator or a data classifier. The problem is implemented on two types of hardware platforms, one a more simple implementation using mbed ( a micro- controller) and other is a purpose-built platform for `Evolution-in-materio" called Mecobo. The results of this study showed that the single walled carbon nanotube composites can be trained to perform simple computational tasks (such as tone discriminator, AND, OR logic gates and a Half adder circuit), as well as complex computational problems such as Full Adder circuit and various binary and multiple class machine learning problems. The study has also identified the suitability of using evolutionary algorithms such as Particle Swarm Optimisation algorithm (PSO) and Differential evolution for finding solutions of complex computational problems such as complex logic gates and various machine learning classification problems. The implementation of classification problem with the carbon nanotube based materials also identified the role of a classifier. It has been found that K-nearest neighbour method and its variant kNN ball tree algorithm are more suitable to train carbon nanotube based materials for different classification problems. The study of varying concentrations of single walled carbon nanotubes in fixed polymer ratio for the solution of different computational problems provided an indication of the link between single walled carbon nanotubes concentration and ability to solve computational problem. The materials used in this study showed stability in the results for all the considered computational problems. These material systems can compliment the current electronic technology and can be used to create a new type of low energy and low cost electronic devices. This offers a promising new direction for evolutionary computation