Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Simple distributed algorithms for the cycle cutset problem
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Asynchronous Search with Aggregations
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison
Over-Constrained Systems
Node and arc consistency in weighted CSP
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
Nogood Recording for Valued Constraint Satisfaction Problems
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
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
Bumping strategies for the multiagent agreement problem
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
A decentralized variable ordering method for distributed constraint optimization
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
Asynchronous aggregation and consistency in distributed constraint satisfaction
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Nogood based asynchronous distributed optimization (ADOPT ng)
AAMAS '06 Proceedings of the fifth 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
Experimental analysis of privacy loss in DCOP algorithms
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
No-commitment branch and bound search for distributed constraint optimization
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Framework for Modeling Reordering Heuristics for Asynchronous Backtracking
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Asynchronous Forward-Bounding for Distributed Constraints Optimization
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
ODPOP: an algorithm for open/distributed constraint optimization
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Constraint propagation for domain bounding in distributed task scheduling
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A quantified distributed constraint optimization problem
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Journal of Artificial Intelligence Research
A study for representations of distributed cooperative search algorithms based on pseudo-trees
SEPADS'11 Proceedings of the 10th WSEAS international conference on Software engineering, parallel and distributed systems
Considering Equality on Distributed Constraint Optimization Problem for Resource Supply Network
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Hi-index | 0.00 |
This article presents an asynchronous algorithm for solving distributed constraint optimization problems (DCOPs). The proposed technique unifies asynchronous backtracking (ABT) and asynchronous distributed optimization (ADOPT) where valued nogoods enable more flexible reasoning and more opportunities for communication, leading to an important speed-up. While feedback can be sent in ADOPT by COST messages only to one predefined predecessor, our extension allows for sending such information to any relevant agent. The concept of valued nogood is an extension by Dago and Verfaille of the concept of classic nogood that associates the list of conflicting assignments with a cost 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). ADOPT has the property of maintaining the initial distribution of the problem. To be efficient, ADOPT needs a preprocessing step consisting of computing a Depth-First Search (DFS) tree on the constraint graph. Valued nogoods allow for automatically detecting and exploiting the best DFS tree compatible with the current ordering. To exploit such DFS trees it is now sufficient to ensure that they exist. Also, the inference rules available for valued nogoods help to exploit schemes of communication where more feedback is sent to higher priority agents. Together they result in an order of magnitude improvement.