Evolutionary swarm robotics: a theoretical and methodological itinerary from individual neuro-controllers to collective behaviours

In the last decade, swarm robotics gathered much attention in the research community. By drawing inspiration from social insects and other self-organizing systems, it focuses on large robot groups featuring distributed control, adaptation, high robustness, and flexibility. Various reasons lay behind this interest in similar multi-robot systems. Above all, inspiration comes from the observation of social activities, which are based on concepts like division of labor, cooperation, and communication. If societies are organized in such a way in order to be more efficient, then robotic groups also could benefit from similar paradigms

Self-organising agent communities for autonomic resource management

The autonomic computing paradigm addresses the operational challenges presented by increasingly complex software systems by proposing that they be composed of many autonomous components, each responsible for the run-time reconfiguration of its own dedicated hardware and software components. Consequently, regulation of the whole software system becomes an emergent property of local adaptation and learning carried out by these autonomous system elements. Designing appropriate local adaptation policies for the components of such systems remains a major challenge. This is particularly true where the system’s scale and dynamism compromise the efficiency of a central executive and/or prevent components from pooling information to achieve a shared, accurate evidence base for their negotiations and decisions.In this paper, we investigate how a self-regulatory system response may arise spontaneously from local interactions between autonomic system elements tasked with adaptively consuming/providing computational resources or services when the demand for such resources is continually changing. We demonstrate that system performance is not maximised when all system components are able to freely share information with one another. Rather, maximum efficiency is achieved when individual components have only limited knowledge of their peers. Under these conditions, the system self-organises into appropriate community structures. By maintaining information flow at the level of communities, the system is able to remain stable enough to efficiently satisfy service demand in resource-limited environments, and thus minimise any unnecessary reconfiguration whilst remaining sufficiently adaptive to be able to reconfigure when service demand changes

Controlling Robot Swarm Aggregation through a Minority of Informed Robots

Self-organised aggregation is a well studied behaviour in swarm robotics as it is the pre-condition for the development of more advanced group-level responses. In this paper, we investigate the design of decentralised algorithms for a swarm of heterogeneous robots that self-aggregate over distinct target sites. A previous study has shown that including as part of the swarm a number of informed robots can steer the dynamic of the aggregation process to a desirable distribution of the swarm between the available aggregation sites. We have replicated the results of the previous study using a simplified approach, we removed constraints related to the communication protocol of the robots and simplified the control mechanisms regulating the transitions between states of the probabilistic controller. The results show that the performances obtained with the previous, more complex, controller can be replicated with our simplified approach which offers clear advantages in terms of portability to the physical robots and in terms of flexibility. That is, our simplified approach can generate self-organised aggregation responses in a larger set of operating conditions than what can be achieved with the complex controller.Comment: Submitted to ANTS 202

Game-theoretical approach for task allocation problems with constraints

The distributed task allocation problem, as one of the most interesting distributed optimization challenges, has received considerable research attention recently. Previous works mainly focused on the task allocation problem in a population of individuals, where there are no constraints for affording task amounts. The latter condition, however, cannot always be hold. In this paper, we study the task allocation problem with constraints of task allocation in a game-theoretical framework. We assume that each individual can afford different amounts of task and the cost function is convex. To investigate the problem in the framework of population games, we construct a potential game and calculate the fitness function for each individual. We prove that when the Nash equilibrium point in the potential game is in the feasible solutions for the limited task allocation problem, the Nash equilibrium point is the unique globally optimal solution. Otherwise, we also derive analytically the unique globally optimal solution. In addition, in order to confirm our theoretical results, we consider the exponential and quadratic forms of cost function for each agent. Two algorithms with the mentioned representative cost functions are proposed to numerically seek the optimal solution to the limited task problems. We further perform Monte Carlo simulations which provide agreeing results with our analytical calculations

A Hormone Inspired System for On-line Adaptation in Swarm Robotic Systems

Individual robots, while providing the opportunity to develop a bespoke and specialised system, suffer in terms of performance when it comes to executing a large number of concurrent tasks. In some cases it is possible to drastically increase the speed of task execution by adding more agents to a system, however this comes at a cost. By mass producing relatively simple robots, costs can be kept low while still gaining the benefit of large scale multi-tasking. This approach sits at the core of swarm robotics. Robot swarms excel in tasks that rely heavily on their ability to multi-task, rather than applications that require bespoke actuation. Swarm suited tasks include: exploration, transportation or operation in dangerous environments. Swarms are particularly suited to hazardous environments due to the inherent expendability that comes with having multiple, decentralised agents. However, due to the variance in the environments a swarm may explore and their need to remain decentralised, a level of adaptability is required of them that can't be provided before a task begins. Methods of novel hormone-inspired robotic control are proposed in this thesis, offering solutions to these problems. These hormone inspired systems, or virtual hormones, provide an on-line method for adaptation that operates while a task is executed. These virtual hormones respond to environmental interactions. Then, through a mixture of decay and stimulant, provide values that grant contextually relevant information to individual robots. These values can then be used in decision making regarding parameters and behavioural changes. The hormone inspired systems presented in this thesis are found to be effective in mid-task adaptation, allowing robots to improve their effectiveness with minimal user interaction. It is also found that it is possible to deploy amalgamations of multiple hormone systems, controlling robots at multiple levels, enabling swarms to achieve strong, energy-efficient, performance