The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Consistency Maintenance for ABT
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Distributed breakout revisited
Eighteenth national conference on Artificial intelligence
Distributed Constraint Satisfaction Algorithm for Complex Local Problems
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Constraint Processing
HOWTO: Asynchronous PFC-MRDAC -Optimization in Distributed Constraint Problems±Adopt
IAT '03 Proceedings of the IEEE/WIC International Conference on Intelligent Agent Technology
Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Distributed Constraint Satisfaction and Optimization with Privacy Enforcement
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Asynchronous backtracking without adding links: a new member in the ABT family
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking
Autonomous Agents and Multi-Agent Systems
Adaptive price update in distributed Lagrangian relaxation protocol
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Dynamic Backtracking for Distributed Constraint Optimization
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Asynchronous forward bounding for distributed COPs
Journal of Artificial Intelligence Research
Distributed Constraint Optimization for Large Teams of Mobile Sensing Agents
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Railroad Driving Model Based on Distributed Constraint Optimization
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Analyzing the performance of distributed algorithms
PerMIS '07 Proceedings of the 2007 Workshop on Performance Metrics for Intelligent Systems
SBDO: A New Robust Approach to Dynamic Distributed Constraint Optimisation
PRIMA '09 Proceedings of the 12th International Conference on Principles of Practice in Multi-Agent Systems
Improving DPOP with function filtering
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Balancing local resources and global goals in multiply-constrained DCOP
Multiagent and Grid Systems
Connecting BnB-ADOPT with soft arc consistency: initial results
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Distributed constraint optimization with MULBS: A case study on collaborative meeting scheduling
Journal of Network and Computer Applications
Hi-index | 0.00 |
This work proposes an asynchronous algorithm for solving Distributed Constraint Optimization problems (DCOPs) using a new kind of nogoods, namely valued nogoods. The proposed technique is an extension of the asynchronous distributed optimization (ADOPT) where valued nogoods enable more flexible reasoning, leading to important speed-up. Valued nogoods are an extension of classic nogoods that associates each nogood with a threshold and optionally with a set of references to culprit constraints.DCOPs have been shown to have very elegant distributed solutions, such as ADOPT, distributed asynchronous overlay (DisAO), or DPOP. These algorithms are typically tuned to minimize the longest causal chain of messages, as a measure of how the algorithms will scale for systems with remote agents (with large latency in communication). Among the mentioned techniques, DPOP performs very well for the chosen metric (requiring a number of such sequential messages linear in the number of agents), but in general has exponential space requirements. DisAO and ADOPT have the advantage of needing only polynomial space. ADOPT has the property of maintaining the initial distribution of the problem. ADOPT needs a preprocessing step consisting of computing a depth first search (DFS) tree on the agent graph. We show that valued nogoods reduce the practical importance/need of this preprocessing since independent subproblems are now dynamically detected and exploited.