Theory and algorithms for plan merging
Artificial Intelligence
HTN planning: complexity and expressivity
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
TALplanner: A temporal logic based forward chaining planner
Annals of Mathematics and Artificial Intelligence
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
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
Introduction: special issue on distributed constraint satisfaction
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Efficient implementation of the plan graph in STAN
Journal of Artificial Intelligence Research
Modeling belief in dynamic systems part II: revision and update
Journal of Artificial Intelligence Research
Multi-agent plan diagnosis and negotiated repair
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers
Plan-Coordination Mechanisms and the Price of Autonomy
Computational Logic in Multi-Agent Systems
Introduction to planning in multiagent systems
Multiagent and Grid Systems - Planning in multiagent systems
Plan decoupling of agents with qualitatively constrained tasks
Multiagent and Grid Systems - Planning in multiagent systems
Coordination by design and the price of autonomy
Autonomous Agents and Multi-Agent Systems
Decomposing constraint systems: equivalences and computational properties
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Framework and complexity results for coordinating non-cooperative planning agents
MATES'06 Proceedings of the 4th German conference on Multiagent System Technologies
Hi-index | 0.00 |
We consider planning problems where a number of non-cooperative agents have to work on a joint problem. Such problems consist in completing 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. Since the agents are non-cooperative, they insist on planning independently and do not want to revise their individual plans when the joint plan has to be assembled from the individual plans. We present a general formal framework to study some computational aspects of this non-cooperative coordination problem and we establish some complexity results to identify some of the factors that contribute to the complexity of this problem. Finally, we illustrate our approach with an application to coordination in multi-modal logistic planning.