X. Zheng and S. Koenig. Greedy Approaches for Solving Task-Allocation Problems with Coalitions. In AAMAS-08 Workshop on Formal Models and Methods for Multi-Robot Systems, pages 35-40, 2008.

Abstract: We study task-allocation problems where one wants to minimize the team cost subject to the constraint that each task must be executed by a given number of cooperative agents simultaneously, called the coalition for this task. We use the same principle to develop several efficient and effective (greedy) hillclimbing strategies for determining both which agents belong to the coalition for each task and when the coalition should execute the task. We analyze their complexities and compare them experimentally with each other and a previous algorithm on multi-agent routing problems.

Download the paper in pdf.

Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.

This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.