A Plan Fusion Algorithm for Multi-Agent Systems

Title

A Plan Fusion Algorithm for Multi-Agent Systems

 Author

De Weerdt, M.M.
Bos, A.
Tonino, J.F.M.
Witteveen, C.

Faculty

Electrical Engineering, Mathematics and Computer Science

 Department

Software Computer Technology

 Date

2000-07-25

 Abstract

We introduce an algorithm for cooperative planning in multi-agent systems. The algorithm enables the agents to combine (fuse) their plans in order to increase their joint profits. A computational resources and skills framework is developed for representing the planned activities of an agent under time constraints. Using this resource-skill framework, we present an efficient (polynomial time) algorithm that fuses the plans of a group of agents in such a way that their joint profits improve. The framework and the algorithm are illustrated using a simplified example from the freight transport domain.

 To reference this document use:

http://resolver.tudelft.nl/uuid:b8f18c98-cee4-472c-9bf2-dc8d5a072af1

 Source

CL-2000: Workshop on Computational Logic in Multi-Agent Systems, CLIMA-I, London, UK, 24-25 July 2000

 Part of collection

Institutional Repository

 Document type

conference paper

 Rights

(c) 2000 The Author(s)
Files
PDF plan_fusion.pdf 243.42 KB
Close viewer