Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, considering faster incomplete algorithms is necessary for large-scale applications. Most incomplete algorithms generally do not provide any guarantees on the quality of solutions. Some notable exceptions are DALO, the bounded max-sum algorithm, and ADPOP.
In this paper, we develop a new solution criterion called p-optimality and an incomplete algorithm for obtaining a p-optimal solution. The characteristics of this algorithm are as follows: (i) it can provide the upper bounds of the absolute/relative errors of the solution, which can be obtained a priori/a posteriori, respectively, (ii) it is based on a pseudo-tree, which is a widely used graph structure in complete DCOP algorithms, (iii) it is a one-shot type algorithm, which runs in polynomial-time in the number of agents n assuming p is fixed, and (iv) it has adjustable parameter p, so that agents can trade-off better solution quality against computational overhead. The evaluation results illustrate that this algorithm can obtain better quality solutions and bounds compared to existing bounded incomplete algorithms, while the run time of this algorithm is shorter.
Unable to display preview. Download preview PDF.
- 1.Atlas, J., Warner, M., Decker, K.: A memory bounded hybrid approach to distributed constraint optimization. In: Proceedings of the 11th International Workshop on Distributed Constraint Reasoning, pp. 37–51 (2008)Google Scholar
- 4.Kiekintveld, C., Yin, Z., Kumar, A., Tambe, M.: Asynchronous algorithms for approximate distributed constraint optimization with quality bounds. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, pp. 133–140 (2010)Google Scholar
- 5.Kjaerulff, U.: Reduction of computational complexity in bayesian networks through removal of weak dependences. In: Proceedings of the 10th International Conference on Uncertainty in Artificial Intelligence, pp. 374–382 (1994)Google Scholar
- 6.Léauté, T., Ottens, B., Szymanek, R.: FRODO 2.0: An open-source framework for distributed constraint optimization. In: Proceedings of the 12th International Workshop on Distributed Constraint Reasoning, pp. 160–164 (2009)Google Scholar
- 7.Mailler, R., Lesser, V.: Using cooperative mediation to solve distributed constraint satisfaction problems. In: Proceedings of the 3rd International Conference on Autonomous Agents and Multiagent Systems, pp. 446–453 (2004)Google Scholar
- 9.Pearce, J., Tambe, M.: Quality guarantees on k-optimal solutions for distributed constraint optimization problems. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 1446–1451 (2007)Google Scholar
- 12.Petcu, A., Faltings, B.: A scalable method for multiagent constraint optimization. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 266–271 (2005)Google Scholar
- 15.Vinyals, M., Shieh, E., Cerquides, J., Rodriguez-Aguilar, J.A., Yin, Z., Tambe, M., Bowring, E.: Quality guarantees for region optimal DCOP algorithms. In: Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems, pp. 133–140 (2011)Google Scholar
- 16.Yin, Z.: USC dcop repository. University of Southern California, Department of Computer Science (2008)Google Scholar
- 18.Zivan, R.: Anytime local search for distributed constraint optimization. In: Proceedings of the 23rd National Conference on Artificial Intelligence, pp. 393–398 (2008)Google Scholar