{"id":91613,"updated":"2025-01-21T15:24:56.569024+00:00","links":{},"created":"2025-01-18T23:40:50.551195+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00091613","sets":["581:7002:7148"]},"path":["7148"],"owner":"11","recid":"91613","title":["経路の特徴を反映した評価値の更新をともなう木探索"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-04-15"},"_buckets":{"deposit":"af697624-ce58-4886-9f49-ae8457012dbb"},"_deposit":{"id":"91613","pid":{"type":"depid","value":"91613","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":"A Tree Search Method with Improvement of Search Cost Estimation Based on Characteristics of Cost Allocation","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[一般論文] 木探索，発見的探索，A*アルゴリズム，有効分岐因子，コストの偏り","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2013-04-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"和歌山大学経済学部"},{"subitem_text_value":"和歌山大学システム工学部"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Economics, Wakayama University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Systems Engineering, Wakayama 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/91613/files/IPSJ-JNL5404047.pdf"},"date":[{"dateType":"Available","dateValue":"2015-04-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5404047.pdf","filesize":[{"value":"600.5 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":"588b2e91-d0ee-486d-9fc3-d028a315f046","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2013 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"芦田, 昌也"},{"creatorName":"瀧, 寛和"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masaya, Ashida","creatorNameLang":"en"},{"creatorName":"Hirokazu, Taki","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":"根から葉節点に向かい，順次大きいコストを持つ辺で作られた木構造における探索手法を提案する．提案手法は，A*アルゴリズムをベースとして，直近に観測したコストの真値を利用し，所与のコストの推定値を更新しながら探索を進めるものである．コストの推定値は，その真値を超えないように更新されるため，対象とする問題空間において，提案手法は最適解を発見することが保証される．また，コストの推定値を更新することにより，その真値に近づけることができる．そのため，解を発見するまでに提案手法が展開する節点数は，同一の問題空間に適用したA*アルゴリズムによって展開される節点数以下であることが保証される．さらに，完全二分木を対象としたシミュレーションの結果からは，推定コストの初期値の精度にかかわらず，問題空間のいずれの深さにおいても，提案手法による有効分岐因子の値は，A*アルゴリズムより小さいことが示される．提案手法は，A*アルゴリズムの特性を継承しつつ，コストの分布に特徴がある問題空間において有効な手法であると考えられる．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This article proposes a search method applied to a tree structure that each link cost is larger than the cost of its precedent link along the path from root node to each leaf node. The proposed method searches the tree structure, updating the estimation of link cost based on the actual value of its precedent link cost. It is proved that the proposed method is able to find an optimal solution. And it is also proved that the number of expanded nodes by the proposed method in finding the solution is less than or equal to the number of expanded nodes by A* algorithm. Results of simulation using the proposed method on complete binary trees show that EBF (effective branching factor) by the proposed method is smaller than that by A* algorithm on each depth regardless of the accuracy of the initial value of estimated cost. The proposed method inherits some of known properties of A* algorithm and is effective to the tree structure which is assigned the characteristic cost.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1640","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1632","bibliographicIssueDates":{"bibliographicIssueDate":"2013-04-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"54"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}