The blockchain: a new framework for robotic swarm systems

Swarms of robots will revolutionize many industrial applications, from targeted material delivery to precision farming. However, several of the heterogeneous characteristics that make them ideal for certain future applications --- robot autonomy, decentralized control, collective emergent behavior, etc. --- hinder the evolution of the technology from academic institutions to real-world problems. Blockchain, an emerging technology originated in the Bitcoin field, demonstrates that by combining peer-to-peer networks with cryptographic algorithms a group of agents can reach an agreement on a particular state of affairs and record that agreement without the need for a controlling authority. The combination of blockchain with other distributed systems, such as robotic swarm systems, can provide the necessary capabilities to make robotic swarm operations more secure, autonomous, flexible and even profitable. This work explains how blockchain technology can provide innovative solutions to four emergent issues in the swarm robotics research field. New security, decision making, behavior differentiation and business models for swarm robotic systems are described by providing case scenarios and examples. Finally, limitations and possible future problems that arise from the combination of these two technologies are described

An Approach Based on Particle Swarm Optimization for Inspection of Spacecraft Hulls by a Swarm of Miniaturized Robots

The remoteness and hazards that are inherent to the operating environments of space infrastructures promote their need for automated robotic inspection. In particular, micrometeoroid and orbital debris impact and structural fatigue are common sources of damage to spacecraft hulls. Vibration sensing has been used to detect structural damage in spacecraft hulls as well as in structural health monitoring practices in industry by deploying static sensors. In this paper, we propose using a swarm of miniaturized vibration-sensing mobile robots realizing a network of mobile sensors. We present a distributed inspection algorithm based on the bio-inspired particle swarm optimization and evolutionary algorithm niching techniques to deliver the task of enumeration and localization of an a priori unknown number of vibration sources on a simplified 2.5D spacecraft surface. Our algorithm is deployed on a swarm of simulated cm-scale wheeled robots. These are guided in their inspection task by sensing vibrations arising from failure points on the surface which are detected by on-board accelerometers. We study three performance metrics: (1) proximity of the localized sources to the ground truth locations, (2) time to localize each source, and (3) time to finish the inspection task given a 75% inspection coverage threshold. We find that our swarm is able to successfully localize the present so

Keeping Humans in the Loop: Pooling Knowledge through Artificial Swarm Intelligence to Improve Business Decision Making

This article explores how a collaboration technology called Artificial Swarm Intelligence (ASI) addresses the limitations associated with group decision making, amplifies the intelligence of human groups, and facilitates better business decisions. It demonstrates of how ASI has been used by businesses to harness the diverse perspectives that individual participants bring to groups and to facilitate convergence upon decisions. It advances the understanding of how artificial intelligence (AI) can be used to enhance, rather than replace, teams as they collaborate to make business decisions

Simple individual behavioural rules for improving the collective behaviours of robot swarms

Swarm robotics is an ongoing area of research that is expected to revolutionise various real-world domains such as agriculture and space exploration. Swarm robotics systems are composed of a large number of simple and autonomous robots. Each robot locally interacts with other robots and with the environment following a set of behavioural rules. These individual interactions enable the swarm to exhibit interesting collective behaviours and to accomplish specific tasks. The main challenge in designing robot swarms is to determine the behavioural rules that each robot should follow so that the swarm as a whole can perform the desired task. The performance of robot swarms in a given task depends on the designer's choice of appropriate individual behavioural rules. In this thesis, we investigate simple individual behavioural rules for improving the performance of robot swarms in two major tasks. Using simple behavioural rules makes the designed solutions possibly usable with simpler platforms such as micro- and nanorobots. The first task we address is known as the best-of-n decision problem where the swarm is required to select the best option among n available alternatives. Solving the best-of-n decision problem is considered to be a fundamental cognitive skill for robot swarms as it influences the swarm's success in other tasks. In this thesis, we introduce individual behavioural rules to improve the performance of robot swarms in the best-of-n problem. Through these rules, robots vary their interaction strength over time in a decentralised fashion to balance the acquisition and the dissemination of information. The proposed behavioural rules allow swarms of simple noisy robots with constrained communication to limit the effect of individual errors and make highly accurate collective decisions in a predictable time. In some scenarios where the best option changes over time, the swarm is required to switch its decision accordingly. In this thesis, we introduce individual behavioural rules through which the robots process new information and discard outdated beliefs. These behavioural rules enable robot swarms to adapt their decisions to various environmental changes, including the appearance of better choices or the disappearance of the current swarm's choice. Our analysis shows that relying on local communication is more favourable for achieving adaptation. This result highlights the benefit of the local sensing and communication characterising biological and artificial swarms. The second task we address in this thesis is the collective resource collection task. In this task, the robots are asked to retrieve objects that are clustered at unknown locations in the environment. We address this task because of its numerous potential real-world applications. In many of these applications, the objects to collect are assigned different importance or value. In this thesis, we introduce a bio-inspired individual behaviour that allows robot swarms to perform quality-based resource collection. Similarly to foraging ants, in our proposed behaviour, the robots coordinate their collection efforts by laying and sensing virtual pheromone trails. The use of pheromone trails offers an advantageous implementation of the memory and communication capabilities necessary for the efficient collection of clustered objects. The proposed behaviour allows robot swarms to satisfy various collection objectives and achieve an optimal resource collection behaviour in the case of relatively small swarms. In this thesis, we analyse swarm robotics systems using both minimalistic tools such as stochastic and multi-agent simulations, and more advanced tools such as physics-based simulations and real robot experiments. Using these tools, we demonstrate the effectiveness of the proposed individual behavioural rules in improving the performance of robot swarms in the addressed tasks. The results we present in this thesis are of potential interest to both engineers designing robot swarms, and biologists investigating the behavioural rules followed by individuals in living collective organisms

Cooperative Object Transport in Multi-robot Systems:A Review of the State-of-the-Art

In recent years, there has been a growing interest in designing multi-robot systems (hereafter MRSs) to provide cost effective, fault-tolerant and reliable solutions to a variety of automated applications. Here, we review recent advancements in MRSs specifically designed for cooperative object transport, which requires the members of MRSs to coordinate their actions to transport objects from a starting position to a final destination. To achieve cooperative object transport, a wide range of transport, coordination and control strategies have been proposed. Our goal is to provide a comprehensive summary for this relatively heterogeneous and fast-growing body of scientific literature. While distilling the information, we purposefully avoid using hierarchical dichotomies, which have been traditionally used in the field of MRSs. Instead, we employ a coarse-grain approach by classifying each study based on the transport strategy used; pushing-only, grasping and caging. We identify key design constraints that may be shared among these studies despite considerable differences in their design methods. In the end, we discuss several open challenges and possible directions for future work to improve the performance of the current MRSs. Overall, we hope to increase the visibility and accessibility of the excellent studies in the field and provide a framework that helps the reader to navigate through them more effectivelypublishersversionPeer reviewe

Scalable Control Strategies and a Customizable Swarm Robotic Platform for Boundary Coverage and Collective Transport Tasks

abstract: Swarms of low-cost, autonomous robots can potentially be used to collectively perform tasks over large domains and long time scales. The design of decentralized, scalable swarm control strategies will enable the development of robotic systems that can execute such tasks with a high degree of parallelism and redundancy, enabling effective operation even in the presence of unknown environmental factors and individual robot failures. Social insect colonies provide a rich source of inspiration for these types of control approaches, since they can perform complex collective tasks under a range of conditions. To validate swarm robotic control strategies, experimental testbeds with large numbers of robots are required; however, existing low-cost robots are specialized and can lack the necessary sensing, navigation, control, and manipulation capabilities. To address these challenges, this thesis presents a formal approach to designing biologically-inspired swarm control strategies for spatially-confined coverage and payload transport tasks, as well as a novel low-cost, customizable robotic platform for testing swarm control approaches. Stochastic control strategies are developed that provably allocate a swarm of robots around the boundaries of multiple regions of interest or payloads to be transported. These strategies account for spatially-dependent effects on the robots' physical distribution and are largely robust to environmental variations. In addition, a control approach based on reinforcement learning is presented for collective payload towing that accommodates robots with heterogeneous maximum speeds. For both types of collective transport tasks, rigorous approaches are developed to identify and translate observed group retrieval behaviors in Novomessor cockerelli ants to swarm robotic control strategies. These strategies can replicate features of ant transport and inherit its properties of robustness to different environments and to varying team compositions. The approaches incorporate dynamical models of the swarm that are amenable to analysis and control techniques, and therefore provide theoretical guarantees on the system's performance. Implementation of these strategies on robotic swarms offers a way for biologists to test hypotheses about the individual-level mechanisms that drive collective behaviors. Finally, this thesis describes Pheeno, a new swarm robotic platform with a three degree-of-freedom manipulator arm, and describes its use in validating a variety of swarm control strategies.Dissertation/ThesisDoctoral Dissertation Mechanical Engineering 201

Abstractions, Analysis Techniques, and Synthesis of Scalable Control Strategies for Robot Swarms

Tasks that require parallelism, redundancy, and adaptation to dynamic, possibly hazardous environments can potentially be performed very efficiently and robustly by a swarm robotic system. Such a system would consist of hundreds or thousands of anonymous, resource-constrained robots that operate autonomously, with little to no direct human supervision. The massive parallelism of a swarm would allow it to perform effectively in the event of robot failures, and the simplicity of individual robots facilitates a low unit cost. Key challenges in the development of swarm robotic systems include the accurate prediction of swarm behavior and the design of robot controllers that can be proven to produce a desired macroscopic outcome. The controllers should be scalable, meaning that they ensure system operation regardless of the swarm size. This thesis presents a comprehensive approach to modeling a swarm robotic system, analyzing its performance, and synthesizing scalable control policies that cause the populations of different swarm elements to evolve in a specified way that obeys time and efficiency constraints. The control policies are decentralized, computed a priori, implementable on robots with limited sensing and communication capabilities, and have theoretical guarantees on performance. To facilitate this framework of abstraction and top-down controller synthesis, the swarm is designed to emulate a system of chemically reacting molecules. The majority of this work considers well-mixed systems when there are interaction-dependent task transitions, with some modeling and analysis extensions to spatially inhomogeneous systems. The methodology is applied to the design of a swarm task allocation approach that does not rely on inter-robot communication, a reconfigurable manufacturing system, and a cooperative transport strategy for groups of robots. The third application incorporates observations from a novel experimental study of the mechanics of cooperative retrieval in Aphaenogaster cockerelli ants. The correctness of the abstractions and the correspondence of the evolution of the controlled system to the target behavior are validated with computer simulations. The investigated applications form the building blocks for a versatile swarm system with integrated capabilities that have performance guarantees

Models of multi-agent decision making

In this thesis we formalise and study computational aspects of group decision making for rational, self-interested agents. Specifically, we are interested in systems where agents reach consensus according to endogenous thresholds. Natural groups have been shown to make collective decisions according to threshold-mediated behaviours. An individual will commit to some collective endeavour only if the number of others having already committed exceeds their threshold. Consensus is reached only where all individuals express commitment. We present a family of models that describe fundamental aspects of cooperative behaviour in multi-agent systems. These include: coalition formation, participation in joint actions and the achievement of individuals’ goals over time. We associate novel solution concepts with our models and present results concerning the computational complexity of several natural decision problems arising from these. We demonstrate potential applications of our work by modelling a group decision problem common to many cohesive groups: establishing the location of the group. Using model checking tools we compute the effects of agents’ thresholds upon outcomes. We consider our results within an appropriate research context