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.
['M.M. De Weerdt', 'A. Bos', 'J.F.M. Tonino', 'Cees Witteveen']
A Plan Fusion Algorithm for Multi-Agent Systems