Market-based multirobot coordination approaches have received significant attention and are growing in popularity within the robotics research community. They have been successfully implemented in a variety of domains ranging from mapping and exploration to robot soccer. The research literature on market-based approaches to coordination has now reached a critical mass that warrants a survey and analysis. This paper addresses this need for a survey of the relevant literature by providing an introduction to market-based multirobot coordination, a review and analysis of the state of the art in the field, and a discussion of remaining research challenges

/pdf/market-based-multirobot-coordination-a-survey-and-analysis-54mewq3cve.pdf

Market-Based Multirobot Coordination: A Survey and Analysis

This paper addresses task allocation to coordinate a fleet of autonomous vehicles by presenting two decentralized algorithms: the consensus-based auction algorithm (CBAA) and its generalization to the multi-assignment problem, i.e., the consensus-based bundle algorithm (CBBA). These algorithms utilize a market-based decision strategy as the mechanism for decentralized task selection and use a consensus routine based on local communication as the conflict resolution mechanism to achieve agreement on the winning bid values. Under reasonable assumptions on the scoring scheme, both of the proposed algorithms are proven to guarantee convergence to a conflict-free assignment, and it is shown that the converged solutions exhibit provable worst-case performance. It is also demonstrated that CBAA and CBBA produce conflict-free feasible solutions that are robust to both inconsistencies in the situational awareness across the fleet and variations in the communication network topology. Numerical experiments confirm superior convergence properties and performance when compared with existing auction-based task-allocation algorithms.

/pdf/consensus-based-decentralized-auctions-for-robust-task-1piputm5m3.pdf

Consensus-Based Decentralized Auctions for Robust Task Allocation

Task allocation is an important aspect of many multi-robot systems. The features and complexity of multi-robot task allocation (MRTA) problems are dictated by the requirements of the particular domain under consideration. These problems can range from those involving instantaneous distribution of simple, independent tasks among members of a homogenous team, to those requiring the time-extended scheduling of complex interrelated multi-step tasks for members of a heterogenous team related by several constraints. The existing widely used taxonomy for task allocation in multi-robot systems was designed for problems with independent tasks and does not deal with problems with interrelated utilities and constraints. While that taxonomy was a ground-breaking contribution to the MRTA literature, a survey of recent work in MRTA reveals that it is no longer a sufficient taxonomy, due to the increasing importance of interrelated utilities and constraints in realistic MRTA problems under consideration. Thus, in this paper, we present a new, comprehensive taxonomy, iTax, that explicitly takes into consideration the issues of interrelated utilities and constraints. Our taxonomy maps categories of MRTA problems to existing mathematical models from combinatorial optimization and operations research, and hence draws important parallels between robotics and these fields.

A comprehensive taxonomy for multi-robot task allocation

Interest in control of multiple autonomous vehicles continues to grow for applications such as weather monitoring, geographical mapping fauna surveys, and extra-terrestrial exploration. The task of persistent surveillance is of particular significance in that the target area needs to be continuously surveyed, minimizing the time between visitations to the same region. This distinction from one-time coverage does not allow a straightforward application of most exploration techniques to the problem, though ideas from these methods can still be used. The aerial vehicle dynamic and endurance constraints add additional complexity to the autonomous control problem, whereas stochastic environments and vehicle failures introduce uncertainty. In this work, we investigate techniques for high-level control, that are scalable, reliable, efficient, and robust to problem dynamics. Next, we suggest a modification to the control policy to account for aircraft dynamic constraints. We also devise a health monitoring policy and a control policy modification to improve performance under endurance constraints. The Vehicle Swarm Technology Laboratory-a hardware testbed developed at Boeing Research and Technology, Seattle, WA, for evaluating a swarm of unmanned air vehicles-is then described, and these control policies are tested in a realistic scenario.

Control of Multiple UAVs for Persistent Surveillance: Algorithm and Flight Test Results

Recently, auction methods have been investigated as effective, decentralized methods for multi-robot coordination. Experimental research has shown great potential, but has not been complemented yet by theoretical analysis. In this paper we contribute a theoretical analysis of the performance of auction methods for multi-robot routing. We suggest a generic framework for auction-based multi-robot routing and analyze a variety of bidding rules for different team objectives. This is the first time that auction methods are shown to offer theoretical guarantees for such a variety of bidding rules and team objectives.

https://www2.isye.gatech.edu/~pinar/robotics2005.pdf

Auction-Based Multi-Robot Routing

We study how to coordinate a team of mobile robots to visit a number of given targets in a partially unknown terrain. Robotics researchers have studied single-item auctions to perform this exploration task but these do not make synergies between the targets into account. We therefore design combinatorial auctions, propose different combinatorial bidding strategies and compare their performance with each other, as well as to single item auctions and an optimal centralized mechanism. Our computational results in teambots, a multi-robot simulator, indicate that combinatorial auctions generally lead to significantly superior team performance than single-item auctions, and generate very good results compared to an optimal centralized mechanism.

H. Huang

Papers

Robot exploration with combinatorial auctions