Mining qualitative context models from multiagent interactions

Emilio Serrano, Michael Rovatsos, Juan A. Botía

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

The focus of multiagent planning research has recently turned towards domains with self-interested agents leading to the definition of Coalition--Planning Games (CoPGs). In this paper, we investigate algorithms for solving a restricted class of "safe" CoPGs, in which no agent can benefit from making another agent's plan invalid. We introduce a novel, generalised solution concept, and show how problems can be translated so that they can be solved by standard single--agent planners. However, standard planners cannot solve problems like this efficiently. We then introduce a new multiagent planning algorithm and the benefits of our approach are illustrated empirically in an example logistics domain.
Original languageEnglish
Title of host publicationAAMAS '11 The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
EditorsLiz Sonenberg, Peter Stone, Kagan Tumer, Pinar Yolum
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems
Number of pages2
ISBN (Electronic)978-0-9826571-7-1
ISBN (Print)ISBN:0-9826571-7-X
Publication statusPublished - 2011


Dive into the research topics of 'Mining qualitative context models from multiagent interactions'. Together they form a unique fingerprint.

Cite this