Framework and complexity results for coordinating non-cooperative planning agents

  • Authors:
  • J. Renze Steenhuisen;Cees Witteveen;Adriaan W. ter Mors;Jeroen M. Valk

  • Affiliations:
  • Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, GA Delft, The Netherlands;Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, GA Delft, The Netherlands;Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, GA Delft, The Netherlands;Almende, DJ Rotterdam, The Netherlands

  • Venue:
  • MATES'06 Proceedings of the 4th German conference on Multiagent System Technologies
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In multi-agent planning problems agents are requested to jointly solve a complex task consisting of a set of interrelated tasks. Since none of the agents is capable to solve the whole task on its own, usually each of them is assigned to a subset of tasks. If agents are dependent upon each other via interrelated tasks they are assigned to, moderately coupled teams of agents are called for. Such teams solve the task by coordinating during or after planning and revising their plans if necessary. In this paper we show that such complex tasks also can be solved by loosely coupled teams of agents that are able to plan independently, although the computational complexity of the coordination problems involved is high. We also investigate some of the factors influencing this complexity.