2011 · 49 citations · 9 references
ComputingComputer ScienceAlgorithmsDistributed SystemsSchedulingDistributed AlgorithmsDistributed ComputingDistributed SchedulingMulti-agent SystemsOnline AlgorithmsTask AllocationAgent SchedulingDistributed Approximation AlgorithmsDynamic Task AllocationDynamic Task SchedulingMulti-agent Resource AllocationMulti-agent SchedulingPruningSearch Space Pruning
We introduce a novel distributed algorithm for multi-agent task allocation problems where the sets of tasks and agents constantly change over time. We build on an existing anytime algorithm (fast-max-sum), and give it significant new capa- bilities: namely, an online pruning procedure that simplifies the problem, and a branch-and-bound technique that reduces the search space. This allows us to scale to problems with hundreds of tasks and agents. We empirically evaluate our algorithm against established benchmarks and find that, even in such large environments, a solution is found up to 31% faster, and with up to 23% more utility, than state-of-the-art approximation algorithms. In addition, our algorithm sends up to 30% fewer messages than current approaches when the set of agents or tasks changes.
9
Methods for task allocation via agent coalition formation
Onn Shehory, Sarit Kraus · Artificial Intelligence · 1998 · 1.1K citations
The generalized distributive law
S.M. Aji, Robert J. McEliece · IEEE Transactions on Information Theory · 2000 · 754 citations
Allocating tasks in extreme teams
Paul Scerri, Alessandro Farinelli, Steven Okamoto et al. · 2005 · 149 citations