DEALING WITH COALITION FORMATION IN THE ROBOCUP RESCUE - An Heuristic Approach

Daniel Epstein, Ana L. C. Bazzan

2011

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.

Paper Citation

in Harvard Style

Epstein D. and L. C. Bazzan A. (2011). DEALING WITH COALITION FORMATION IN THE ROBOCUP RESCUE - An Heuristic Approach . In Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-40-9, pages 717-720. DOI: 10.5220/0003294607170720

in Bibtex Style

@conference{icaart11,
author={Daniel Epstein and Ana L. C. Bazzan},
title={DEALING WITH COALITION FORMATION IN THE ROBOCUP RESCUE - An Heuristic Approach},
booktitle={Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2011},
pages={717-720},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003294607170720},
isbn={978-989-8425-40-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - DEALING WITH COALITION FORMATION IN THE ROBOCUP RESCUE - An Heuristic Approach
SN - 978-989-8425-40-9
AU - Epstein D.
AU - L. C. Bazzan A.
PY - 2011
SP - 717
EP - 720
DO - 10.5220/0003294607170720