Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
The parallel execution of DO loops
Communications of the ACM
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Using Cooperative Mediation to Solve Distributed Constraint Satisfaction Problems
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
CMRadar: a personal assistant agent for calendar management
AOIS'04 Proceedings of the 6th international conference on Agent-Oriented Information Systems II
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking
Autonomous Agents and Multi-Agent Systems
Completeness and performance of the APO algorithm
Journal of Artificial Intelligence Research
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
When should there be a "Me" in "Team"?: distributed multi-agent optimization under uncertainty
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Towards an Understanding of the Value of Cooperation in Uncertain World
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
The power of ants in solving Distributed Constraint Satisfaction Problems
Applied Soft Computing
Solving distributed CSPs using dynamic, partial centralization without explicit constraint passing
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Improving Asynchronous Partial Overlay
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Target to sensor allocation: A hierarchical dynamic Distributed Constraint Optimization approach
Computer Communications
Improving the privacy of the asynchronous partial overlay protocol
Multiagent and Grid Systems - Principles and Practice of Multi-Agent Systems
| Hi-index | 0.00 |
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally proposed two different sets of approaches for solving DCSPs, backtracking based approaches, such as Asynchronous Backtracking (ABT), and mediation based approaches, such as Asynchronous Partial Overlay (APO). These sets of approaches differ in the levels of coordination employed during conflict resolution. While the computational and communication complexity of the backtracking based approaches is well understood, the tradeoffs in complexity involved in moving toward mediation based approaches are not. In this paper we comprehensively reexamine the space of mediation based approaches for DCSP and fill gaps in existing frameworks with new strategies. We present different mediation session selection rules, including a rule that favors smaller mediation sessions, and different mediation strategies, including a decentralized hybrid strategy based on ABT. We present empirical results on solvable 3-coloring and random binary DCSP problems, that accurately capture the computational and communication tradeoffs between ABT and various mediation based approaches. Our results confirm that under some circumstances the newly presented strategies dominate previously proposed techniques.