Coalitions among computationally bounded agents
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Methods for task allocation via agent coalition formation
Artificial Intelligence
Coalition formation with uncertain heterogeneous information
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Task Allocation via Multi-Agent Coalition Formation: Taxonomy, Algorithms and Complexity
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Generating Coalition Structures with Finite Bound from the Optimal Guarantees
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Sequential bundle-bid single-sale auction algorithms for decentralized control
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Negotiation with reaction functions for solving complex task allocation problems
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Static and expanding grid coverage with ant robots: Complexity results
Theoretical Computer Science
Multi-agent Cooperative Cleaning of Expanding Domains
International Journal of Robotics Research
Generalized reaction functions for solving complex-task allocation problems
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Distributed problem solving in geometrically-structured constraint networks
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.01 |
In this paper, we present ARF, our initial effort at solving task-allocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routing problems where several agents need to visit targets simultaneously, for example, to move obstacles out of the way cooperatively. First, we propose reaction functions as a novel way of characterizing the costs of agents in a distributed way. Second, we show how to approximate reaction functions so that their computation and communication times are polynomial. Third, we show how reaction functions can be used by a central planner to allocate tasks to agents. Finally, we show experimentally that the resulting task allocations are better than those of other greedy methods that do not use reaction functions.