Distributed search method with bounded cost vectors on multiple objective DCOPs

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

doi:10.1007/978-3-642-32729-2_10

Distributed search method with bounded cost vectors on multiple objective DCOPs

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

Intelligence Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

18 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 language	English
Title of host publication	PRIMA 2012
Subtitle of host publication	Principles and Practice of Multi-Agent Systems - 15th International Conference, Proceedings
Publisher	Springer Verlag
Pages	137-152
Number of pages	16
ISBN (Print)	9783642327285
DOIs	https://doi.org/10.1007/978-3-642-32729-2_10
Publication status	Published - 2012
Event	15th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2012 - Kuching, Sarawak, Malaysia Duration: Sept 3 2012 → Sept 7 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7455 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	15th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2012
Country/Territory	Malaysia
City	Kuching, Sarawak
Period	9/3/12 → 9/7/12

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-32729-2_10

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 (pp. 137-152). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7455 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-642-32729-2_10

Distributed search method with bounded cost vectors on multiple objective DCOPs. / Matsui, Toshihiro; Silaghi, Marius; Hirayama, Katsutoshi et al.
PRIMA 2012: Principles and Practice of Multi-Agent Systems - 15th International Conference, Proceedings. Springer Verlag, 2012. p. 137-152 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7455 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7455 LNAI, Springer Verlag, pp. 137-152, 15th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2012, Kuching, Sarawak, Malaysia, 9/3/12. https://doi.org/10.1007/978-3-642-32729-2_10

Matsui T, Silaghi M, Hirayama K, Yokoo M, Matsuo H. 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. Springer Verlag. 2012. p. 137-152. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-32729-2_10

Matsui, Toshihiro ; Silaghi, Marius ; Hirayama, Katsutoshi et al. / Distributed search method with bounded cost vectors on multiple objective DCOPs. PRIMA 2012: Principles and Practice of Multi-Agent Systems - 15th International Conference, Proceedings. Springer Verlag, 2012. pp. 137-152 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ff716fa017a5493089f1dc304d488ef3,

title = "Distributed search method with bounded cost vectors on multiple objective DCOPs",

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.",

author = "Toshihiro Matsui and Marius Silaghi and Katsutoshi Hirayama and Makoto Yokoo and Hiroshi Matsuo",

note = "Copyright: Copyright 2021 Elsevier B.V., All rights reserved.; 15th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2012 ; Conference date: 03-09-2012 Through 07-09-2012",

year = "2012",

doi = "10.1007/978-3-642-32729-2_10",

language = "English",

isbn = "9783642327285",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "137--152",

booktitle = "PRIMA 2012",

address = "Germany",

}

TY - GEN

T1 - Distributed search method with bounded cost vectors on multiple objective DCOPs

AU - Matsui, Toshihiro

AU - Silaghi, Marius

AU - Hirayama, Katsutoshi

AU - Yokoo, Makoto

AU - Matsuo, Hiroshi

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84887381243&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84887381243&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-32729-2_10

DO - 10.1007/978-3-642-32729-2_10

M3 - Conference contribution

AN - SCOPUS:84887381243

SN - 9783642327285

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 137

EP - 152

BT - PRIMA 2012

PB - Springer Verlag

T2 - 15th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2012

Y2 - 3 September 2012 through 7 September 2012

ER -

Distributed search method with bounded cost vectors on multiple objective DCOPs

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this