Linear-space best-first search
Artificial Intelligence
Performance of linear-space search algorithms
Artificial Intelligence
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
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
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
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
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
AND/OR branch-and-bound for graphical models
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
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
Caching schemes for DCOP search algorithms
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Adaptive price update in distributed Lagrangian relaxation protocol
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Directed soft arc consistency in pseudo trees
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
Artificial Intelligence
Trading off solution quality for faster computation in DCOP search algorithms
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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
A quantified distributed constraint optimization problem
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
BnB-ADOPT+ with Several Soft Arc Consistency Levels
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
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
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
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
Overlay networks for task allocation and coordination in large-scale networks of cooperative agents
Autonomous Agents and Multi-Agent Systems
Stratified tree search: a novel suboptimal heuristic search algorithm
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Target to sensor allocation: A hierarchical dynamic Distributed Constraint Optimization approach
Computer Communications
| Hi-index | 0.00 |
Distributed constraint optimization (DCOP) problems are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOP problems optimally with memory-bounded and asynchronous algorithms. We introduce Branch-and-Bound ADOPT (BnB-ADOPT), a memory-bounded asynchronous DCOP algorithm that uses the message passing and communication framework of ADOPT, a well known memory-bounded asynchronous DCOP algorithm, but changes the search strategy of ADOPT from best-first search to depth-first branch-and-bound search. Our experimental results show that BnB-ADOPT is up to one order of magnitude faster than ADOPT on a variety of large DCOP problems and faster than NCBB, a memory-bounded synchronous DCOP algorithm, on most of these DCOP problems.