Distributed Algorithms
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
DCOPolis: a framework for simulating and deploying distributed constraint reasoning algorithms
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers
Coordination of first responders under communication and resource constraints
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Trading off solution cost for smaller runtime in DCOP search algorithms
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking
Autonomous Agents and Multi-Agent Systems
Caching schemes for DCOP search algorithms
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Distributed constraint optimization with structured resource constraints
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
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
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
Measurement techniques for multiagent systems
PerMIS '08 Proceedings of the 8th Workshop on Performance Metrics for Intelligent Systems
Asynchronous inter-level forward-checking for DisCSPs
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Journal of Artificial Intelligence Research
Balancing local resources and global goals in multiply-constrained DCOP
Multiagent and Grid Systems
Bounded approximate decentralised coordination via the max-sum algorithm
Artificial Intelligence
Decentralized and optimal control of shared resource pools
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special section on formal methods in pervasive computing, pervasive adaptation, and self-adaptive systems: Models and algorithms
SBDO: a new robust approach to dynamic distributed constraint optimisation
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Anytime AND/OR depth-first search for combinatorial optimization
AI Communications - The Symposium on Combinatorial Search
Concurrent forward bounding for distributed constraint optimization problems
Artificial Intelligence
Local coordination in online distributed constraint optimization problems
EUMAS'11 Proceedings of the 9th European conference on Multi-Agent Systems
Removing redundant messages in N-ary BnB-ADOPT
Journal of Artificial Intelligence Research
Protecting privacy through distributed computation in multi-agent decision making
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modifications for efficiency in a multiagent setting. Two main features of the algorithm are: (a) using different agents to search non-intersecting parts of a search space concurrently, and (b) communicating lower bounds on solution cost every time there is a possibility the bounds might change due to changed variable assignments. The first leads to a better utilization of computational resources of multiple participating agents, while the second provides for more efficient pruning of search space.Experimental results show that NCBB has significantly better performance than another polynomial-space algorithm, ADOPT, on random graph coloring problems. Under assumptions of cheap communication it also has comparable performance with DPOP despite using only polynomial memory as opposed to exponential memory for DPOP.