Task partitioning in swarms of robots: an adaptive method for strategy selection

Task partitioning is the decomposition of a task into two or more sub-tasks that can be tackled separately. Task partitioning can be observed in many species of social insects, as it is often an advantageous way of organizing the work of a group of individuals. Potential advantages of task partitioning are, among others: reduction of interference between workers, exploitation of individuals?? skills and specializations, energy efficiency, and higher parallelism. Even though swarms of robots can benefit from task partitioning in the same way as social insects do, only few works in swarm robotics are dedicated to this subject. In this paper, we study the case in which a swarm of robots has to tackle a task that can be partitioned into a sequence of two sub-tasks. We propose a method that allows the individual robots in the swarm to decide whether to partition the given task or not. The method is self-organized, relies on the experience of each individual, and does not require explicit communication between robots. We evaluate the method in simulation experiments, using foraging as testbed. We study cases in which task partitioning is preferable and cases in which it is not. We show that the proposed method leads to good performance of the swarm in both cases, by employing task partitioning only when it is advantageous. We also show that the swarm is able to react to changes in the environmental conditions by adapting the behavior on-line. Scalability experiments show that the proposed method performs well across all the tested group sizes.     

A response-adaptive randomization procedure for multi-armed clinical trials with normally distributed outcomes

We propose a novel response-adaptive randomization procedure for multi-armed trials with continuous outcomes that are assumed to be normally distributed. Our proposed rule is non-myopic, and oriented toward a patient benefit objective, yet maintains computational feasibility. We derive our response-adaptive algorithm based on the Gittins index for the multi-armed bandit problem, as a modification of the method first introduced in Villar et al. (Biometrics, 71, pp. 969-978). The resulting procedure can be implemented under the assumption of both known or unknown variance. We illustrate the proposed procedure by simulations in the context of phase II cancer trials. Our results show that, in a multi-armed setting, there are efficiency and patient benefit gains of using a response-adaptive allocation procedure with a continuous endpoint instead of a binary one. These gains persist even if an anticipated low rate of missing data due to deaths, dropouts, or complete responses is imputed online through a procedure first introduced in this paper. Additionally, we discuss how there are response-adaptive designs that outperform the traditional equal randomized design both in terms of efficiency and patient benefit measures in the multi-armed trial context.     

Collective unary decision-making by decentralized multiple-robot systems applied to the task-sequencing problem

When a complex mission must be undertaken, it often can be simplified by dividing it into a sequence of smaller subtasks, which are then completed in order. This strategy implicitly requires a system to recognize the completion of each subtask and make the decision to begin work on the next one. Decentralized multiple-robot systems can tackle many tasks, but their behavior is typified by continuous responses to stimuli. Task sequencing, however, demands a controlled, self-induced phase change in collective behavior—working on one task one moment and then on a different task the next—which is nontrivial for an emergent system. The main contribution of this study is a collective decision-making framework for decentralized multiple-robot systems that enables such a system to cooperatively decide that a current task has been completed and thus focus its attention on the next one in a sequence using only anonymous local communication. Central to the framework is the use of consensus, whereby task sequencing is delayed until a prespecified proportion of a system’s robots agree that the current task is complete, reducing the likelihood of premature decisions. Two low-cost consensus estimation strategies are presented, both of which are practical for the extremely simple robots that are expected to compose large decentralized systems. Experiments in simulation and with real robots demonstrate that the proposed decision-making framework performs as predicted. Although the specific application of collective decision-making in this work is the cooperative task-sequencing problem, the proposed decision-making framework potentially has many additional applications.     

Content-Aware Dispatching Algorithms for Cluster-Based Web Servers

Cluster-based Web servers are leading architectures for highly accessed Web sites. The most common Web cluster architecture consists of replicated server nodes and a Web switch that routes client requests among the nodes. In this paper, we consider content-aware Web switches that can use application level information to assign client requests. We evaluate the performance of some representative state-of-the-art dispatching algorithms for Web switches operating at layer 7 of the OSI protocol stack. Specifically, we consider dispatching algorithms that use only client information as well as the combination of client and server information for load sharing, reference locality or service partitioning. We demonstrate through a wide set of simulation experiments that dispatching policies aiming to improve locality in server caches give best results for traditional Web publishing sites providing static information and some simple database searches. On the other hand, when we consider more recent Web sites providing dynamic and secure services, dispatching policies that aim to share the load are the most effective.     

Designing pheromone communication in swarm robotics: Group foraging behavior mediated by chemical substance

In swarm robotics, communication among the robots is essential. Inspired by biological swarms using pheromones, we propose the use of chemical compounds to realize group foraging behavior in robot swarms. We designed a fully autonomous robot, and then created a swarm using ethanol as the trail pheromone allowing the robots to communicate with one another indirectly via pheromone trails. Our group recruitment and cooperative transport algorithms provide the robots with the required swarm behavior. We conducted both simulations and experiments with real robot swarms, and analyzed the data statistically to investigate any changes caused by pheromone communication in the performance of the swarm in solving foraging recruitment and cooperative transport tasks. The results show that the robots can communicate using pheromone trails, and that the improvement due to pheromone communication may be non-linear, depending on the size of the robot swarm.     

Stability and performance of ant queue inspired task partitioning methods

In this paper, we consider computing systems that have autonomous helper components which fulfill support functions and that possess reconfigurable hardware so that they can specialize to different types of service tasks. Several self-organized task partitioning methods are proposed that can be used by the helper components to decide how to reconfigure and which service tasks to execute. The proposed task partitioning methods are inspired by the so-called ant queue system that can be found in real ants for partitioning tasks between the individuals. The aim of this study is to investigate basic properties of the task partitioning methods, like stability and efficiency, in order to obtain basic insights into the design of task partitioning methods in self-organized service systems. More precisely, the investigations are threefold: (1) discrete event simulations are used to investigate systems, (2) for a simple version of the task partitioning system analytical stability results are obtained by means of delay differential equation systems and (3) by numerically solving initial value problems.     

Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors

In this paper, we consider the problem of scheduling and mapping precedence-constrained tasks to a network of heterogeneous processors. In such systems, processors are usually physically distributed, implying that the communication cost is considerably higher than in tightly coupled multiprocessors. Therefore, scheduling and mapping algorithms for such systems must schedule the tasks as well as the communication traffic by treating both the processors and communication links as equally important resources. We propose an algorithm that achieves these objectives and adapts its task scheduling and mapping decisions according to the given network topology. Just like tasks, messages are also scheduled and mapped to suitable links during the minimization of the finish times of tasks. Heterogeneity of processors is exploited by scheduling critical tasks to the fastest processors. Our experimental study has demonstrated that the proposed algorithm is efficient and robust, and yields consistent performance over a wide range of scheduling parameters. This revised version was published online in July 2006 with corrections to the Cover Date.     

A knowledge-based system for the strategic control level of robots in flexible manufacturing cells

The strategic control level synthesis for robots is related to a hierarchical robot control problem. The main control problem at the strategic control level is to select the model and algorithm to be used by the lower control level to execute the given robot task. Usually there are several lower control level models and algorithms that can be used by the robot control system for every robot task. Strategic control level synthesis depends on the particular robot system application. In a typical application, when the robot system is used in a flexible manufacturing system for manipulating various part types, the robot tasks executed by the robot system depend on the manufacturing processes in the system. If the robot system is applied in another flexible manufacturing system, dedicated to other manufacturing processes, another set of robot tasks might be needed to perform the necessary operations. Therefore, the quantity and the kind of knowledge required in the system for the strategic control level differ from one application to another. Such a fact creates the appropriate conditions for employing some artificial intelligence techniques. This article describes a knowledge-based system approach to the strategic control level synthesis problem.     

Tug-of-war model for the two-bandit problem: Nonlocally-correlated parallel exploration via resource conservation

We propose a model - the “tug-of-war (TOW) model” - to conduct unique parallel searches using many nonlocally-correlated search agents. The model is based on the property of a single-celled amoeba, the true slime mold Physarum, which maintains a constant intracellular resource volume while collecting environmental information by concurrently expanding and shrinking its branches. The conservation law entails a “nonlocal correlation” among the branches, i.e., volume increment in one branch is immediately compensated by volume decrement(s) in the other branch(es). This nonlocal correlation was shown to be useful for decision making in the case of a dilemma. The multi-armed bandit problem is to determine the optimal strategy for maximizing the total reward sum with incompatible demands, by either exploiting the rewards obtained using the already collected information or exploring new information for acquiring higher payoffs involving risks. Our model can efficiently manage the “exploration-exploitation dilemma” and exhibits good performances. The average accuracy rate of our model is higher than those of well-known algorithms such as the modified ?-greedy algorithm and modified softmax algorithm, especially, for solving relatively difficult problems. Moreover, our model flexibly adapts to changing environments, a property essential for living organisms surviving in uncertain environments.     

Developing Subdomain Allocation Algorithms Based on Spatial and Communicational Constraints to Accelerate Dust Storm Simulation

Dust storm has serious disastrous impacts on environment, human health, and assets. The developments and applications of dust storm models have contributed significantly to better understand and predict the distribution, intensity and structure of dust storms. However, dust storm simulation is a data and computing intensive process. To improve the computing performance, high performance computing has been widely adopted by dividing the entire study area into multiple subdomains and allocating each subdomain on different computing nodes in a parallel fashion. Inappropriate allocation may introduce imbalanced task loads and unnecessary communications among computing nodes. Therefore, allocation is a key factor that may impact the efficiency of parallel process. An allocation algorithm is expected to consider the computing cost and communication cost for each computing node to minimize total execution time and reduce overall communication cost for the entire simulation. This research introduces three algorithms to optimize the allocation by considering the spatial and communicational constraints: 1) an Integer Linear Programming (ILP) based algorithm from combinational optimization perspective; 2) a K-Means and Kernighan-Lin combined heuristic algorithm (K&K) integrating geometric and coordinate-free methods by merging local and global partitioning; 3) an automatic seeded region growing based geometric and local partitioning algorithm (ASRG). The performance and effectiveness of the three algorithms are compared based on different factors. Further, we adopt the K&K algorithm as the demonstrated algorithm for the experiment of dust model simulation with the non-hydrostatic mesoscale model (NMM-dust) and compared the performance with the MPI default sequential allocation. The results demonstrate that K&K method significantly improves the simulation performance with better subdomain allocation. This method can also be adopted for other relevant atmospheric and numerical modeling.     

Evolving coordinated group behaviours through maximisation of mean mutual information

A well known problem in the design of the control system for a swarm of robots concerns the definition of suitable individual rules that result in the desired coordinated behaviour. A possible solution to this problem is given by the automatic synthesis of the individual controllers through evolutionary or learning processes. These processes offer the possibility to freely search the space of the possible solutions for a given task, under the guidance of a user-defined utility function. Nonetheless, there exist no general principles to follow in the definition of such a utility function in order to reward coordinated group behaviours. As a consequence, task dependent functions must be devised each time a new coordination problem is under study. In this paper, we propose the use of measures developed in Information Theory as task-independent, implicit utility functions. We present two experiments in which three robots are trained to produce generic coordinated behaviours. Each robot is provided with rich sensory and motor apparatus, which can be exploited to explore the environment and to communicate with other robots. We show how coordinated behaviours can be synthesised through a simple evolutionary process. The only criteria used to evaluate the performance of the robotic group is the estimate of mutual information between the motor states of the robots.     

Distributed scalable multi-robot learning using particle swarm optimization

Designing effective behavioral controllers for mobile robots can be difficult and tedious; this process can be circumvented by using online learning techniques which allow robots to generate their own controllers online in an automated fashion. In multi-robot systems, robots operating in parallel can potentially learn at a much faster rate by sharing information amongst themselves. In this work, we use an adapted version of the Particle Swarm Optimization algorithm in order to accomplish distributed online robotic learning in groups of robots with access to only local information. The effectiveness of the learning technique on a benchmark task (generating high-performance obstacle avoidance behavior) is evaluated for robot groups of various sizes, with the maximum group size allowing each robot to individually contain and manage a single PSO particle. To increase the realism of the technique, different PSO neighborhoods based on limitations of real robotic communication are tested and compared in this scenario. We explore the effect of varying communication power for one of these communication-based PSO neighborhoods. To validate the effectiveness of these learning techniques, fully distributed online learning experiments are run using a group of 10 real robots, generating results which support the findings from our simulations.     

A fuzzy-based reliability system for knowledge sharing between robots in P2P JXTA-overlay platform

The design of an efficient collaborative multi-robot framework that ensures the autonomy and the individual requirements of the involved robots is a very challenging task. This requires designing an efficient platform for inter-robot communication. P2P is a good approach to achieve this goal. P2P aims at making the communication ubiquitous thereby crossing the communication boundary and has many attractive features to use it as a platform for collaborative multi-robot environments. In this paper, we present our implemented P2P system based on JXTA Overlay. We use JXTA Overlay as a platform for robot collaboration and knowledge sharing. We also propose a fuzzy-based peer reliability system for JXTA-Overlay platform considering three parameters: Actual Behavior Criterion (ABC), Mutually Agreed Behavior (MAB) and Reputation (R). We evaluated the knowledge sharing system by many experiments and show that this system has a good performance and can be used successfully for knowledge sharing between robots. Also, we present some simulation results, which show the fuzzy-based peer reliability system has a good behavior and can successfully select the best peer candidate.     

Self-organized cooperation between robotic swarms

We study self-organized cooperation between heterogeneous robotic swarms. The robots of each swarm play distinct roles based on their different characteristics. We investigate how the use of simple local interactions between the robots of the different swarms can let the swarms cooperate in order to solve complex tasks. We focus on an indoor navigation task, in which we use a swarm of wheeled robots, called foot-bots, and a swarm of flying robots that can attach to the ceiling, called eye-bots. The task of the foot-bots is to move back and forth between a source and a target location. The role of the eye-bots is to guide foot-bots: they choose positions at the ceiling and from there give local directional instructions to foot-bots passing by. To obtain efficient paths for foot-bot navigation, eye-bots need on the one hand to choose good positions and on the other hand learn the right instructions to give. We investigate each of these aspects. Our solution is based on a process of mutual adaptation, in which foot-bots execute instructions given by eye-bots, and eye-bots observe the behavior of foot-bots to adapt their position and the instructions they give. Our approach is inspired by pheromone mediated navigation of ants, as eye-bots serve as stigmergic markers for foot-bot navigation. Through simulation, we show how this system is able to find efficient paths in complex environments, and to display different kinds of complex and scalable self-organized behaviors, such as shortest path finding and automatic traffic spreading.     

Composing Problem Solvers for Simulation Experimentation: A Case Study on Steady State Estimation

Simulation experiments involve various sub-tasks, e.g., parameter optimization, simulation execution, or output data analysis. Many algorithms can be applied to such tasks, but their performance depends on the given problem. Steady state estimation in systems biology is a typical example for this: several estimators have been proposed, each with its own (dis-)advantages. Experimenters, therefore, must choose from the available options, even though they may not be aware of the consequences. To support those users, we propose a general scheme to aggregate such algorithms to so-called synthetic problem solvers, which exploit algorithm differences to improve overall performance. Our approach subsumes various aggregation mechanisms, supports automatic configuration from training data (e.g., via ensemble learning or portfolio selection), and extends the plugin system of the open source modeling and simulation framework James II. We show the benefits of our approach by applying it to steady state estimation for cell-biological models.     

System Matrix Analysis for Computed Tomography Imaging

In practical applications of computed tomography imaging (CT), it is often the case that the set of projection data is incomplete owing to the physical conditions of the data acquisition process. On the other hand, the high radiation dose imposed on patients is also undesired. These issues demand that high quality CT images can be reconstructed from limited projection data. For this reason, iterative methods of image reconstruction have become a topic of increased research interest. Several algorithms have been proposed for few-view CT. We consider that the accurate solution of the reconstruction problem also depends on the system matrix that simulates the scanning process. In this work, we analyze the application of the Siddon method to generate elements of the matrix and we present results based on real projection data.     

Initial Development of a Novel Amphibious Robot with Transformable Fin-Leg Composite Propulsion Mechanisms

Amphibious robots are very attractive for their broad applications in resource exploration, disaster rescue, and recon- naissance. However, it is very challenging to develop the robots for their complex, amphibious working environments. In the complex amphibious environment, amphibious robots should possess multi-capabilities to walk on rough ground, maneuver underwater, and pass through transitional zones such as sandy and muddy terrain. These capabilities require a high-performance propulsion mechanism for the robots. To tackle a complex task, a novel amphibious robot （AmphiHex-I） with,transformable fin-leg composite propulsion mechanisms is developed. With the fin-leg composite propulsions, AmphiHex-I can walk on rough and soft substrates and swim in water with many maneuvers. This paper presents the structural design of the transformable fin-leg propulsion mechanism and its driving module. A hybrid model is used to explore the dynamics between the trans- formable legs and transitional environment such as granular medium. The locomotion performances of legs with various ellip- tical shapes are analyzed, which is verified by the coincidence between the model predictions and the simulation results. Further, an orthogonal experiment is conducted to study the locomotion performance of a two-legged platform walking with an asyn- chronous gait in the sandy and muddy terrain. Finally, initial experiments of AmphiHex-I walking on various lands and swimming in water are implemented. These results verify that the transformable fin-leg mechanisms enable the amphibious robot to pass through a complex, amphibious working environment.     

Self-organised path formation in a swarm of robots

In this paper, we study the problem of exploration and navigation in an unknown environment from an evolutionary swarm robotics perspective. In other words, we search for an efficient exploration and navigation strategy for a swarm of robots, which exploits cooperation and self-organisation to cope with the limited abilities of the individual robots. The task faced by the robots consists in the exploration of an unknown environment in order to find a path between two distant target areas. The collective strategy is synthesised through evolutionary robotics techniques, and is based on the emergence of a dynamic structure formed by the robots moving back and forth between the two target areas. Due to this structure, each robot is able to maintain the right heading and to efficiently navigate between the two areas. The evolved behaviour proved to be effective in finding the shortest path, adaptable to new environmental conditions, scalable to larger groups and larger environment size, and robust to individual failures.