Nogood Recording for Valued Constraint Satisfaction Problems
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Nogood based asynchronous distributed optimization (ADOPT ng)
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
| Hi-index | 0.01 |
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering of agents. A distinctive feature of this algorithm is that it uses the concept of valued nogood. Combining lower bounds on inferred valued nogoods computed cooperatively helps pruning dynamically unfeasible sub-problems and speeds up the search. DyBop requires a polynomial space at each agent. Experiments show that DyBop has significantly better performance than other DCOP algorithms.