Auction-Based Task Allocation and Motion Planning for Multi-Robot Systems with Human Supervision

This paper presents a task allocation strategy for a multi-robot system with a human supervisor. The multi-robot system consists of a team of heterogeneous robots with different capabilities that operate in a dynamic scenario that can change in the robots’ capabilities or in the operational requirements. The human supervisor can intervene in the operation scenario by approving the final plan before its execution or forcing a robot to execute a specific task. The proposed task allocation strategy leverages an auction-based method in combination with a sampling-based multi-goal motion planning. The latter is used to evaluate the costs of execution of tasks based on realistic features of paths. The proposed architecture enables the allocation of tasks accounting for priorities and precedence constraints, as well as the quick re-allocation of tasks after a dynamic perturbation occurs –a crucial feature when the human supervisor preempts the outcome of the algorithm and makes manual adjustments. An extensive simulation campaign in a rescue scenario validates our approach in dynamic scenarios comprising a sensor failure of a robot, a total failure of a robot, and a human-driven re-allocation. We highlight the benefits of the proposed multi-goal strategy by comparing it with single-goal motion planning strategies at the state of the art. Finally, we provide evidence for the system efficiency by demonstrating the powerful synergistic combination of the auction-based allocation and the multi-goal motion planning approach

Self-adaptive decision-making mechanisms to balance the execution of multiple tasks for a multi-robots team

This work addresses the coordination problem of multiple robots with the goal of finding specific hazardous targets in an unknown area and dealing with them cooperatively. The desired behaviour for the robotic system entails multiple requirements, which may also be conflicting. The paper presents the problem as a constrained bi-objective optimization problem in which mobile robots must perform two specific tasks of exploration and at same time cooperation and coordination for disarming the hazardous targets. These objectives are opposed goals, in which one may be favored, but only at the expense of the other. Therefore, a good trade-off must be found. For this purpose, a nature-inspired approach and an analytical mathematical model to solve this problem considering a single equivalent weighted objective function are presented. The results of proposed coordination model, simulated in a two dimensional terrain, are showed in order to assess the behaviour of the proposed solution to tackle this problem. We have analyzed the performance of the approach and the influence of the weights of the objective function under different conditions: static and dynamic. In this latter situation, the robots may fail under the stringent limited budget of energy or for hazardous events. The paper concludes with a critical discussion of the experimental results

Operator Objective Function Guidance for a Real-time Unmanned Vehicle Scheduling Algorithm

Advances in autonomy have made it possible to invert the typical operator-to-unmanned-vehicle ratio so that asingle operator can now control multiple heterogeneous unmanned vehicles. Algorithms used in unmanned-vehicle path planning and task allocation typically have an objective function that only takes into account variables initially identified by designers with set weightings. This can make the algorithm seemingly opaque to an operator and brittle under changing mission priorities. To address these issues, it is proposed that allowing operators to dynamically modify objective function weightings of an automated planner during a mission can have performance benefits. A multiple-unmanned-vehicle simulation test bed was modified so that operators could either choose one variable or choose any combination of equally weighted variables for the automated planner to use in evaluating mission plans. Results from a human-participant experiment showed that operators rated their performance and confidence highest when using the dynamic objective function with multiple objectives. Allowing operators to adjust multiple objectives resulted in enhanced situational awareness, increased spare mental capacity, fewer interventions to modify the objective function, and no significant differences in mission performance. Adding this form of flexibility and transparency to automation in future unmanned vehicle systems could improve performance, engender operator trust, and reduce errors.Aurora Flight Sciences, U.S. Office of Naval Researc

Magician simulator — A realistic simulator for heterogeneous teams of autonomous robots

We report on the development of a new simulation environment for use in Multi-Robot Learning, Swarm Robotics, Robot Teaming, Human Factors and Operator Training. The simulator provides a realistic environment for examining methods for localization and navigation, sensor analysis, object identification and tracking, as well as strategy development, interface refinement and operator training (based on various degrees of heterogeneity, robot teaming, and connectivity). The simulation additionally incorporates real-time human-robot interaction and allows hybrid operation with a mix of simulated and real robots and sensor inputs

Predictive Receding-Horizon Multi-Robot Task Allocation with Moving Tasks*

This paper addresses a multi-robot task allocation (MRTA) towards moving tasks and presents a novel computationally efficient predictive allocation algorithm that requires solving a linear program (LP) problem. Following the receding horizon control policy, the present algorithm repeats the optimization of future task assignments within an allocation horizon while predicting the evolution of the system. The online optimization is formulated so that the assignment problem is reduced exactly to an LP. The algorithm is also compared with other traditional methods, namely, the greedy approach and a genetic algorithm (GA). Our results show that the algorithm herein proposed outperforms the greedy approach for small prediction horizons and has significantly lower computational load than GA

Automation and robotics for the Space Exploration Initiative: Results from Project Outreach

A total of 52 submissions were received in the Automation and Robotics (A&R) area during Project Outreach. About half of the submissions (24) contained concepts that were judged to have high utility for the Space Exploration Initiative (SEI) and were analyzed further by the robotics panel. These 24 submissions are analyzed here. Three types of robots were proposed in the high scoring submissions: structured task robots (STRs), teleoperated robots (TORs), and surface exploration robots. Several advanced TOR control interface technologies were proposed in the submissions. Many A&R concepts or potential standards were presented or alluded to by the submitters, but few specific technologies or systems were suggested