{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00223669","sets":["1164:6390:11093:11094"]},"path":["11094"],"owner":"44499","recid":"223669","title":["NPCの行動の最善手探索に関する研究"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-01-16"},"_buckets":{"deposit":"72415701-1144-4138-a6c0-bbcfe5ba2673"},"_deposit":{"id":"223669","pid":{"type":"depid","value":"223669","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"NPCの行動の最善手探索に関する研究","author_link":["589513","589512","589511"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"NPCの行動の最善手探索に関する研究"},{"subitem_title":"A study of the search for the best move for NPC behavior","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ゲームアルゴリズム","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2023-01-16","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京工科大学大学院"},{"subitem_text_value":"東京工科大学"},{"subitem_text_value":"東京工科大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tokyo University of Technology Graduate School","subitem_text_language":"en"},{"subitem_text_value":"Tokyo University of Technology","subitem_text_language":"en"},{"subitem_text_value":"Tokyo University of Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"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/223669/files/IPSJ-CDS23036034.pdf","label":"IPSJ-CDS23036034.pdf"},"date":[{"dateType":"Available","dateValue":"2025-01-16"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CDS23036034.pdf","filesize":[{"value":"3.8 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"47"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"ceb73588-f916-40d6-9125-231ce9c60fca","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"吉田, 涼真"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"阿部, 雅樹"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"渡辺, 大地"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12628327","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8604","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"NPC (ノンプレイヤーキャラクター) の行動は AI によって管理されており，その AI をキャラクター AI と呼ぶ．キャラクター AI には複数の手法が存在し，そのうちの一つの手法として，ゴールベース AI がある．ゴールベース AI は，その他のベース AI が，局所的な判断による行動決定を行うのに対し，長期的な目標を定め，その目標を達成するための行動手順を求める手法である．ゴールベース AI には，2 つの問題点がある．第一に，壁や敵が出現するなどマップにおける状況の変化に臨機応変に対応することができないことである．第二に，既存のゴールベース AI では，複数の条件を考慮した行動決定ができないことである．本研究では，制約付き最短経路問題に基づき，特定の条件を満たし，目的地点に到達するという長期的な目標の達成と，最も良いスコアを出す行動決定を選択する最善手探索手法について研究する．本手法では，マップの各地点における行動を経路探索におけるノードとして扱うことで，経路探索と同様の手順で行動決定をしていく．本稿では，あるノードを 1 度のみ通過できる場合を通過制限あり，複数回通過できる場合を通過制限なしとしてそれぞれ手法の提案を行った．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告コンシューマ・デバイス＆システム（CDS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-01-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"34","bibliographicVolumeNumber":"2023-CDS-36"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:23:31.434330+00:00","updated":"2025-01-19T13:20:36.069377+00:00","id":223669}