A macroscopic analytical model of collaboration in distributed robotic systems

In this article, we present a macroscopic analytical model of collaboration in a group of reactive robots. The model consists of a series of coupled differential equations that describe the dynamics of group behavior. After presenting the general model, we analyze in detail a case study of collaboration, the stick-pulling experiment, studied experimentally and in simulation by Ijspeert et al. [Autonomous Robots, 11, 149-171]. The robots' task is to pull sticks out of their holes, and it can be successfully achieved only through the collaboration of two robots. There is no explicit communication or coordination between the robots. Unlike microscopic simulations (sensor-based or using a probabilistic numerical model), in which computational time scales with the robot group size, the macroscopic model is computationally efficient, because its solutions are independent of robot group size. Analysis reproduces several qualitative conclusions of Ijspeert et al.: namely, the different dynamical regimes for different values of the ratio of robots to sticks, the existence of optimal control parameters that maximize system performance as a function of group size, and the transition from superlinear to sublinear performance as the number of robots is increased

Abstracting Multidimensional Concepts for Multilevel Decision Making in Multirobot Systems

Multirobot control architectures often require robotic tasks to be well defined before allocation. In complex missions, it is often difficult to decompose an objective into a set of well defined tasks; human operators generate a simplified representation based on experience and estimation. The result is a set of robot roles, which are not best suited to accomplishing those objectives. This thesis presents an alternative approach to generating multirobot control algorithms using task abstraction. By carefully analysing data recorded from similar systems a multidimensional and multilevel representation of the mission can be abstracted, which can be subsequently converted into a robotic controller. This work, which focuses on the control of a team of robots to play the complex game of football, is divided into three sections: In the first section we investigate the use of spatial structures in team games. Experimental results show that cooperative teams beat groups of individuals when competing for space and that controlling space is important in the game of robot football. In the second section, we generate a multilevel representation of robot football based on spatial structures measured in recorded matches. By differentiating between spatial configurations appearing in desirable and undesirable situations, we can abstract a strategy composed of the more desirable structures. In the third section, five partial strategies are generated, based on the abstracted structures, and a suitable controller is devised. A set of experiments shows the success of the method in reproducing those key structures in a multirobot system. Finally, we compile our methods into a formal architecture for task abstraction and control. The thesis concludes that generating multirobot control algorithms using task abstraction is appropriate for problems which are complex, weakly-defined, multilevel, dynamic, competitive, unpredictable, and which display emergent properties

Coordination of Multirobot Teams and Groups in Constrained Environments: Models, Abstractions, and Control Policies

Robots can augment and even replace humans in dangerous environments, such as search and rescue and reconnaissance missions, yet robots used in these situations are largely tele-operated. In most cases, the robots\u27 performance depends on the operator\u27s ability to control and coordinate the robots, resulting in increased response time and poor situational awareness, and hindering multirobot cooperation. Many factors impede extended autonomy in these situations, including the unique nature of individual tasks, the number of robots needed, the complexity of coordinating heterogeneous robot teams, and the need to operate safely. These factors can be partly addressed by having many inexpensive robots and by control policies that provide guarantees on convergence and safety. In this thesis, we address the problem of synthesizing control policies for navigating teams of robots in constrained environments while providing guarantees on convergence and safety. The approach is as follows. We first model the configuration space of the group (a space in which the robots cannot violate the constraints) as a set of polytopes. For a group with a common goal configuration, we reduce complexity by constructing a configuration space for an abstracted group state. We then construct a discrete representation of the configuration space, on which we search for a path to the goal. Based on this path, we synthesize feedback controllers, decentralized affine controllers for kinematic systems and nonlinear feedback controllers for dynamical systems, on the polytopes, sequentially composing controllers to drive the system to the goal. We demonstrate the use of this method in urban environments and on groups of dynamical systems such as quadrotors. We reduce the complexity of multirobot coordination by using an informed graph search to simultaneously build the configuration space and find a path in its discrete representation to the goal. Furthermore, by using an abstraction on groups of robots we dissociate complexity from the number of robots in the group. Although the controllers are designed for navigation in known environments, they are indeed more versatile, as we demonstrate in a concluding simulation of six robots in a partially unknown environment with evolving communication links, object manipulation, and stigmergic interactions

A Framework for Collaborative Multi-task, Multi-robot Missions

Robotics is a transformative technology that will empower our civilization for a new scale of human endeavors. Massive scale is only possible through the collaboration of individual or groups of robots. Collaboration allows specialization, meaning a multirobot system may accommodate heterogeneous platforms including human partners. This work develops a unified control architecture for collaborative missions comprised of multiple, multi-robot tasks. Using kinematic equations and Jacobian matrices, the system states are transformed into alternative control spaces which are more useful for the designer or more convenient for the operator. The architecture allows multiple tasks to be combined, composing tightly coordinated missions. Using this approach, the designer is able to compensate for non-ideal behavior in the appropriate space using whatever control scheme they choose. This work presents a general design methodology, including analysis techniques for relevant control metrics like stability, responsiveness, and disturbance rejection, which were missing in prior work. Multiple tasks may be combined into a collaborative mission. The unified motion control architecture merges the control space components for each task into a concise federated system to facilitate analysis and implementation. The task coordination function defines task commands as functions of mission commands and state values to create explicit closed-loop collaboration. This work presents analysis techniques to understand the effects of cross-coupling tasks. This work analyzes system stability for the particular control architecture and identifies an explicit condition to ensure stable switching when reallocating robots. We are unaware of any other automated control architectures that address large-scale collaborative systems composed of task-oriented multi-robot coalitions where relative spatial control is critical to mission performance. This architecture and methodology have been validated in experiments and in simulations, repeating earlier work and exploring new scenarios and. It can perform large-scale, complex missions via a rigorous design methodology

Simultaneous Task Subdivision and Assignment in the FRACTAL Multi-robot System

This paper presents a negotiation protocol for simultaneous task subdivision and assignment in a heterogeneous multi-robot system. The protocol is based on an abstraction of the concept of task that allows it to be applied independently on the actual task, and adopts Rubinsteins’s alternate offers protocol extended with a co-evolutionary step in search for the best (counter)-offer. The protocol has been tested on computer simulated application scenarios

Negotiation of Target Points for Teams of Heterogeneous Robots: an Application to Exploration

In this paper, we present an application to Search and Rescue of a task negotiation protocol for teams of heterogeneous robots. Self-organization through autonomous negotiations allow the robots to assign themselves a number of target observation points decided by the operator, who is relieved from deciding the optimal assignment. The operator can then focus on monitoring the mission and deciding next actions. The protocol has been tested on both computer simulations and real robots

Market-Based Approach to Mobile Surveillance Systems

The active surveillance of public and private sites is increasingly becoming a very important and critical issue. It is, therefore, imperative to develop mobile surveillance systems to protect these sites. Modern surveillance systems encompass spatially distributed mobile and static sensors in order to provide effective monitoring of persistent and transient objects and events in a given area of interest (AOI). The realization of the potential of mobile surveillance requires the solution of different challenging problems such as task allocation, mobile sensor deployment, multisensor management, cooperative object detection and tracking, decentralized data fusion, and interoperability and accessibility of system nodes. This paper proposes a market-based approach that can be used to handle different problems of mobile surveillance systems. Task allocation and cooperative target tracking are studied using the proposed approach as two challenging problems of mobile surveillance systems. These challenges are addressed individually and collectively

Robotic Planning under Hierarchical Temporal Logic Specifications

Past research into robotic planning with temporal logic specifications, notably Linear Temporal Logic (LTL), was largely based on singular formulas for individual or groups of robots. But with increasing task complexity, LTL formulas unavoidably grow lengthy, complicating interpretation and specification generation, and straining the computational capacities of the planners. In order to maximize the potential of LTL specifications, we capitalized on the intrinsic structure of tasks and introduced a hierarchical structure to LTL specifications. In contrast to the "flat" structure, our hierarchical model has multiple levels of compositional specifications and offers benefits such as greater syntactic brevity, improved interpretability, and more efficient planning. To address tasks under this hierarchical temporal logic structure, we formulated a decomposition-based method. Each specification is first broken down into a range of temporally interrelated sub-tasks. We further mine the temporal relations among the sub-tasks of different specifications within the hierarchy. Subsequently, a Mixed Integer Linear Program is utilized to generate a spatio-temporal plan for each robot. Our hierarchical LTL specifications were experimentally applied to domains of robotic navigation and manipulation. Results from extensive simulation studies illustrated both the enhanced expressive potential of the hierarchical form and the efficacy of the proposed method.Comment: 8 pages, 4 figure