On social laws for artificial agent societies: off-line design
Artificial Intelligence - Special volume on computational research on interaction and agency, part 2
Coordinating Plans of Autonomous Agents
Coordinating Plans of Autonomous Agents
Discovering and exploiting synergy between hierarchical planning agents
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Evolution of the GPGP/TÆMS Domain-Independent Coordination Framework
Autonomous Agents and Multi-Agent Systems
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
IEEE Transactions on Computers
On the computational complexity of coalitional resource games
Artificial Intelligence
Hi-index | 0.00 |
We discuss task planning problems where a number of agents have to work on a joint planning problem that consists of a set of interdependent, hierarchically ordered tasks. Each agent is assigned a subset of tasks to perform for which it has to construct a plan. The agents are non-cooperative in that they insist on planning autonomously and do not want to revise their individual plans when a joint plan has to be assembled. The aim of this paper is twofold: first of all to present a general formal framework to study some computational aspects of this non-cooperative coordination problem, and secondly to establish some complexity results and to identify some of the factors that contribute to the complexity of this problem.