Pseudo-tree-based algorithm for approximate distributed constraint optimization with quality bounds

Authors:
Tenda Okimoto;Yongjoon Joe;Atsushi Iwasaki;Makoto Yokoo
Affiliations:
Kyushu University, Fukuoka, Japan;Kyushu University, Fukuoka, Japan;Kyushu University, Fukuoka, Japan;Kyushu University, Fukuoka, Japan
Venue:
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Year:
2011

Citing 4
Cited 0

Constraint Processing

Constraint Processing
A scalable method for multiagent constraint optimization

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Adopt: asynchronous distributed constraint optimization with quality guarantees

Artificial Intelligence - Special issue: Distributed constraint satisfaction
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most incomplete DCOP algorithms generally do not provide any guarantees on the quality of the solutions. In this paper, we introduce a new incomplete DCOP algorithm that can provide the upper bounds of the absolute/relative errors of the solution, which can be obtained a priori/a posteriori, respectively. The evaluation results illustrate that this algorithm can obtain better quality solutions and bounds compared to existing bounded incomplete DCOP algorithms, while the run time of this algorithm is much shorter.