Authors:
Daniel Epstein
and
Ana L. C. Bazzan
Affiliation:
UFRGS, Brazil
Keyword(s):
Robocup rescue, Coalitions, Multiagent systems.
Related
Ontology
Subjects/Areas/Topics:
Agents
;
Artificial Intelligence
;
Artificial Intelligence and Decision Support Systems
;
Computational Intelligence
;
Cooperation and Coordination
;
Distributed and Mobile Software Systems
;
Enterprise Information Systems
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Knowledge Engineering and Ontology Development
;
Knowledge-Based Systems
;
Multi-Agent Systems
;
Soft Computing
;
Software Engineering
;
State Space Search
;
Symbolic Systems
Abstract:
Finding an optimal coalition structure to divide agents in groups is equivalent to the set-partitioning problem. Several algorithms have been proposed. However, even to find a sub-optimal value they have to search within an exponential number of coalition structures. Therefore, in this paper, we use one of the proposed algorithms, which is anytime and hence suits environments such as the RoboCup Rescue, where a response is needed in a short time frame. Moreover, we propose to combine this algorithm with heuristics to reduce and constraint the number of agents and tasks that are allowed to participate in a coalition. In this paper we discuss the application of such an approach in a complex task allocation scenario, the RoboCup Rescue.