{"updated":"2025-01-21T20:11:53.371888+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00079581","sets":["581:6276:6633"]},"path":["6633"],"owner":"11","recid":"79581","title":["擬似木に基づく分散制約最適化問題の精度保証付き非厳密解法の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-12-15"},"_buckets":{"deposit":"9c426b19-de38-487b-9ebe-967dde197db1"},"_deposit":{"id":"79581","pid":{"type":"depid","value":"79581","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"擬似木に基づく分散制約最適化問題の精度保証付き非厳密解法の提案","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"擬似木に基づく分散制約最適化問題の精度保証付き非厳密解法の提案"},{"subitem_title":"Pseudo-tree-based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"一般論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2011-12-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州大学大学院システム情報科学府情報学専攻横尾研究室"},{"subitem_text_value":"九州大学大学院システム情報科学府情報学専攻横尾研究室"},{"subitem_text_value":"九州大学大学院システム情報科学府情報学専攻横尾研究室"},{"subitem_text_value":"九州大学大学院システム情報科学府情報学専攻横尾研究室"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of ISEE, Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of ISEE, Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of ISEE, Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of ISEE, Kyushu University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/79581/files/IPSJ-JNL5212087.pdf"},"date":[{"dateType":"Available","dateValue":"2013-12-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5212087.pdf","filesize":[{"value":"992.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"5061f32c-f114-4ddb-862e-8fa2cd8a49aa","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"沖本, 天太"},{"creatorName":"ジョヨンジュン"},{"creatorName":"岩崎, 敦"},{"creatorName":"横尾, 真"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tenda, Okimoto","creatorNameLang":"en"},{"creatorName":"Yongjoon, Joe","creatorNameLang":"en"},{"creatorName":"Atsushi, Iwasaki","creatorNameLang":"en"},{"creatorName":"Makoto, Yokoo","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"分散制約最適化問題（DCOP）はマルチエージェントシステムにおける協調問題解決の基本的な枠組みである．DCOPはNP-hardであるため，大規模な問題に対して，比較的少ない計算で近似解を探索する非厳密解法を考える必要がある．しかしながら，既存の非厳密解法のほとんどは解品質を保証しない．数少ない例外としてDALO，bounded max-sum解法，ADPOPがある．本論文では，近似解の新しい評価基準$p$-optimalityに基づく非厳密解法を提案する．本解法の特徴を以下に示す．本解法は，(i)得られる解の絶対/相対誤差の上界をそれぞれ事前/事後に与えることができる，(ii) DCOPの厳密解法で広く用いられている擬似木に基づく解法である，(iii)エージェント数nに関して多項式時間で実行可能なone-shot typeの解法である，(iv)調整可能なパラメータpを持つ．実験では本解法が，解品質を保証する既存の非厳密解法と比べ，より高品質な解および高精度な誤差の上界を与えることを示した．さらに本解法は，これらの非厳密解法と比べ，より高速に求解可能であることを示した．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"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, and (iv) it has adjustable parameter p, 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.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"3795","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"3786","bibliographicIssueDates":{"bibliographicIssueDate":"2011-12-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"12","bibliographicVolumeNumber":"52"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:34:17.777718+00:00","id":79581,"links":{}}