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

Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo, Boi Faltings

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

9 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルPrinciples and Practice of Constraint Programming, CP 2011 - 17th International Conference, Proceedings
ページ660-674
ページ数15
DOI
出版ステータス出版済み - 2011
イベント17th International Conference on Principles and Practice of Constraint Programming, CP 2011 - Perugia, イタリア
継続期間: 9 12 20119 16 2011

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6876 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他17th International Conference on Principles and Practice of Constraint Programming, CP 2011
Countryイタリア
CityPerugia
Period9/12/119/16/11

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Pseudo-tree-based incomplete algorithm for distributed constraint optimization with quality bounds」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル