Multiagent planning

Problem properties that matter

Conference paper (2006)
Department
Software Computer Technology (EEMCS) (TU Delft)
Copyright: Campus only
More Info
expand_more

Published Date

27-03-2006

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Source:

Proceedings of the AAAI Spring Symposium on Distributed Plan and Schedule Management, Stanford University, California, USA, 27-29 March 2006

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Computer Technology

Abstract

Many different problems are called distributed or multiagent planning problems. Existing approaches each deal with only a subset of these problems. Which properties are essential in determining a solution method for multiagent planning problems? We argue that mainly the facts that communication is limited, agents have private goals, and the frequency of the dependencies between agents have a significant impact on the solution method.

Files

SS0604deWeerdtM1.pdf
(pdf | 0.0185 Mb)

Download not available