Distributed search method with bounded cost vectors on multiple objective DCOPs

Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Citations (Scopus)

Abstract

We generalize a pseudo-tree based solver to employ boundaries of multi-objective DCOPs. Multi-objective problems have been addressed in the research area of DCOPs recently. For the case of multiple objectives, the objective values are defined as the result of separate evaluation schemes. Applying multi-objectives to pseudo-tree based search is also important to generalize several traditional solvers. Here, we introduce boundaries for the vector of objective values in a solver based on pseudo-trees. Both the bottom-up computation of the partial dynamic-programming and the top-down computation of the tree-search employ the bounded vectors of the objective values. Several operations including aggregation, decomposition and comparison of objective values are extended for the bounded vectors.

Original languageEnglish
Title of host publicationPRIMA 2012: Principles and Practice of Multi-Agent Systems - 15th International Conference, Proceedings
Pages137-152
Number of pages16
Volume7455 LNAI
DOIs
Publication statusPublished - 2012
Event15th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2012 - Kuching, Sarawak, Malaysia
Duration: Sep 3 2012Sep 7 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7455 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other15th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2012
CountryMalaysia
CityKuching, Sarawak
Period9/3/129/7/12

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Distributed search method with bounded cost vectors on multiple objective DCOPs'. Together they form a unique fingerprint.

  • Cite this

    Matsui, T., Silaghi, M., Hirayama, K., Yokoo, M., & Matsuo, H. (2012). Distributed search method with bounded cost vectors on multiple objective DCOPs. In PRIMA 2012: Principles and Practice of Multi-Agent Systems - 15th International Conference, Proceedings (Vol. 7455 LNAI, pp. 137-152). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7455 LNAI). https://doi.org/10.1007/978-3-642-32729-2-10