Trading Off Solution Quality for Faster Computation in DCOP Search Algorithms

Distributed Constraint Optimization (DCOP) is a key technique for solving agent coordination problems. Because finding cost-minimal DCOP solutions is NP-hard, it is important to develop mechanisms for DCOP search algorithms that trade off their solution costs for smaller runtimes. However, existing tradeoff mechanisms do not provide relative error bounds. In this paper, we introduce three tradeoff mechanisms that provide such bounds, namely the Relative Error Mechanism, the Uniformly Weighted Heuristics Mechanism and the Non-Uniformly Weighted Heuristics Mechanism, for two DCOP algorithms, namely ADOPT and BnB-ADOPT. Our experimental results show that the Relative Error Mechanism generally dominates the other two tradeoff mechanisms for ADOPT and the UniformlyWeighted Heuristics Mechanism generally dominates the other two trade-off mechanisms for BnB-ADOPT.

[1]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[2]  Milind Tambe,et al.  Preprocessing techniques for accelerating the DCOP algorithm ADOPT , 2005, AAMAS '05.

[3]  Christian Bessiere,et al.  Non-Binary Constraints , 1999, CP.

[4]  Makoto Yokoo,et al.  Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..

[5]  Ana L. C. Bazzan,et al.  Evaluating the performance of DCOP algorithms in a real world, dynamic problem , 2008, AAMAS.

[6]  Milind Tambe,et al.  Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems , 2007, IJCAI.

[7]  相場亮.  Distributed Constraint Satisfaction： Foundations of Cooperation in Multi - Agent Systems , 2001 .

[8]  Kenneth N. Brown,et al.  Efficient Handling of Complex Local Problems in Distributed Constraint Optimization , 2006, ECAI.

[9]  Weixiong Zhang,et al.  Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks , 2005, Artif. Intell..

[10]  Toby Walsh,et al.  Binary vs. non-binary constraints , 2002, Artif. Intell..

[11]  Milind Tambe,et al.  Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[12]  Sven Koenig,et al.  BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm , 2008, AAMAS.

[13]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[14]  Rina Dechter,et al.  AND/OR Branch-and-Bound for Graphical Models , 2005, IJCAI.

[15]  Manish Jain,et al.  On k-optimal distributed constraint optimization algorithms: new bounds and algorithms , 2008, AAMAS.

[16]  Ira Pohl,et al.  The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving , 1973, IJCAI.