Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
The Effect of Nogood Learning in Distributed Constraint Satisfaction
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Comparing two approaches to dynamic, distributed constraint satisfaction
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Examining DCSP coordination tradeoffs
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Policy-based Coordination in PAGODA: A Case Study
Electronic Notes in Theoretical Computer Science (ENTCS)
Unifying distributed constraint algorithms in a BDI negotiation framework
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Unifying distributed constraint algorithms in a BDI negotiation framework
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
MaxCAPO: a new expansion of APO to solve distributed constraint satisfaction problems
ASC '07 Proceedings of The Eleventh IASTED International Conference on Artificial Intelligence and Soft Computing
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
ADAPT: abstraction hierarchies to succinctly model teamwork
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Pseudo-tree-based incomplete algorithm for distributed constraint optimization with quality bounds
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
On broadcast scheduling with limited energy
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Adaptive and non-adaptive distribution functions for DSA
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
ADAPT: abstraction hierarchies to better simulate teamwork under dynamics
AEGS'11 Proceedings of the 2011 international conference on Agents for Educational Games and Simulations
Group planning with time constraints
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Distributive Constraint Satisfaction (DCSP) has long been considered an important area of research for multi-agent systems. This is partly due to the fact that many real-world problem can be represented as constraint satisfaction and partly because real-world problems often present themselves in a distributed form. In this paper, we present a complete, distributed algorithm called asynchronous partial overlay (APO) for solving DCSPs that is based on a cooperative mediation process. The primary ideasbehind this algorithm are that agents, when acting as a mediator, centralize small, relevant portions of the DCSP, that these centralized subproblems overlap, and that agents increase the size of their subproblems along critical paths within the DCSP as the problem solving unfolds. We present empirical evidence that shows that APO performs better than other known, complete DCSP techniques.