Centralized and distributed task allocation in multi-robot teams via a stochastic clustering auction

@article{Zhang2012CentralizedAD,
  title={Centralized and distributed task allocation in multi-robot teams via a stochastic clustering auction},
  author={Kai Zhang and E. Collins and Dongqing Shi},
  journal={ACM Trans. Auton. Adapt. Syst.},
  year={2012},
  volume={7},
  pages={21:1-21:22}
}
This article considers the problem of optimal task allocation for heterogeneous teams, for example, teams of heterogeneous robots or human-robot teams. [...] Key Method It is based on stochastic transfer and swap moves between the clusters of tasks assigned to the various robots and considers not only downhill movements, but also uphill movements, which can avoid local minima.Expand
An efficient stochastic clustering auction for heterogeneous robot teams
TLDR
The contribution of this work is to present an efficient SCA for heterogeneous teams, based on a modified Swendsen-Wang method, that maintains the efficiency of the second SCA and can yield similar performance to the baseline CSA in far fewer iterations. Expand
Sequential Single-Cluster Auctions for Multi-Robot Task Allocation
TLDR
The results show that allocating clusters of tasks to robots in solving these types of problems is a fast and effective method and produces near optimal solutions. Expand
A distributed method for dynamic multi-robot task allocation problems with critical time constraints
TLDR
Numerical simulations demonstrate that the proposed dynamic grouping allocation method can provide conflict-free solutions in dynamic environments and can achieve outstanding performance in comparison with the state-of-the-art algorithms. Expand
A cluster first strategy for distributed multi-robot task allocation problem with time constraints*
TLDR
This paper considers the problem of having a team of mobile robots to visit a set of survivors before their specified deadlines in a distributed multi-robot system, and proposes a cluster-first strategy, which builds upon existing consensus-based distributed task allocation algorithms. Expand
Decentralized Combinatorial Auctions for Multi-Unit Resource Allocation
TLDR
This paper proposes the first decentralized CA schemes for multi-unit resources with a BRF-based winner determination scheme that enables every agent to locally compute a critical bid value for her to win the CA and accordingly take her best response to other agent's win declaration. Expand
Minimal Time Dynamic Task Allocation for a Swarm of Robots
This paper discusses a solution to one of the key issues in the swarm robotics field which is the dynamic task allocation problem in which a group of robots needs to be allocated to a set of tasksExpand
Towards a Distributed Solution to the Multi-Robot Task Allocation Problem with Energetic and Spatiotemporal Constraints
TLDR
This paper proposes an allocation method (based on parallel distributed guided genetic algorithms) and compares it to two state-of-the-art algorithms and shows the effectiveness and scalability of the solution, even with a large number of robots and tasks. Expand
Min-Max Tours for Task Allocation to Heterogeneous Agents
TLDR
A three phase algorithm is given to solve the problem of allocating tasks among the available agents while minimizing the maximum cost to tour the allocation by any agent and return to the depot, and provides 5-factor approximation. Expand
Memetic algorithms for optimal task allocation in multi-robot systems for inspection problems with cooperative tasks
TLDR
Eight approaches based on four basic coding strategies are designed for multi-robot task allocation of inspection problems with two-ro robot tasks and a novel memetic algorithm is proposed combining a genetic algorithm with two local search schemes. Expand
Multi-robot Task Allocation using Agglomerative Clustering
TLDR
This thesis investigates the performance both when all tasks are known ahead of time as well as when new tasks are injected into the system periodically, investigating the effectiveness of agglomerative hierarchical clustering as compared to K-means clustering. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 60 REFERENCES
A Stochastic Clustering Auction (SCA) for Centralized and Distributed Task Allocation in Multi-agent Teams
TLDR
A solution via a Stochastic Clustering Auction (SCA) that uses a Markov chain search process along with simulated annealing to find optimal task allocation for heterogeneous teams, e.g., teams of heterogeneous robots or human-robot teams is proposed. Expand
Dynamic Task Assignment in Robot Swarms
TLDR
This paper presents four distributed algorithms for assigning swarms of homogenous robots to subgroups to meet a specified global task distribution, and implements the algorithms on a group of 25 iRobot SwarmBots. Expand
Consensus-Based Decentralized Auctions for Robust Task Allocation
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 toExpand
Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control
TLDR
It is demonstrated empirically that the team cost of sequential bundle-bid single-sale (= single-item) auction algorithms can be substantially smaller than that without bundles for multi-agent routing problems with capacity constraints. Expand
Tutorial on Auction-Based Agent Coordination at AAAI 2006
Teams of agents are more robust and potentially more efficient than single agents. However, coordinating teams of agents so that they can successfully complete their mission is a challenging task.Expand
Consensus-Based Auction Approaches for Decentralized Task Assignment
TLDR
This work shows that the proposed algorithms, under reasonable assumptions on the scoring scheme and network connectivity, guarantee convergence to a conflict-free assignment, and the converged solutions are shown to guarantee 50% optimality in the worst-case and to exhibit provably good performance on average. Expand
Consensus-based auctions for decentralized task assignment
This thesis addresses the decentralized task assignment problem in cooperative au- tonomous search and track missions by presenting the Consensus-Based class of as- signment algorithms. TheseExpand
Dynamically formed heterogeneous robot teams performing tightly-coordinated tasks
TLDR
The challenge of pickup teams is defined and proposed and a basic implementation of a pickup team that can search and discover treasure in a previously unknown environment is described. Expand
K-swaps: cooperative negotiation for solving task-allocation problems
TLDR
This paper designs a distributed algorithm that constructs all possible K-swaps that reduce the team cost of a given task allocation and shows that each agent typically only needs to communicate a small part of its local computation results to the other agents. Expand
The Power of Sequential Single-Item Auctions for Agent Coordination
TLDR
Comparing a coordination system based on sequential single- item auctions against those based on either parallel single-item auction, or combinatorial auctions, demonstrates that it combines the advantages of both. Expand
...
1
2
3
4
5
...