{"updated":"2025-01-22T16:11:08.143646+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032414","sets":["1164:2592:2686:2689"]},"path":["2689"],"owner":"1","recid":"32414","title":["双対変数を用いたA*両方向探索アルゴリズムと経路誘導における最短路問題"],"pubdate":{"attribute_name":"公開日","attribute_value":"1994-07-22"},"_buckets":{"deposit":"33d1fc49-f775-408a-8b46-6e2679a65dc6"},"_deposit":{"id":"32414","pid":{"type":"depid","value":"32414","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"双対変数を用いたA*両方向探索アルゴリズムと経路誘導における最短路問題","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"双対変数を用いたA*両方向探索アルゴリズムと経路誘導における最短路問題"},{"subitem_title":"Bidirectional A* Algorithm for the Shortest Path Problem in Route Navigation Systems","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1994-07-22","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学理学部情報科学科"},{"subitem_text_value":"東京大学理学部情報科学科"},{"subitem_text_value":"住友電気工業"},{"subitem_text_value":"住友電気工業"},{"subitem_text_value":"住友電気工業"},{"subitem_text_value":"住友電気工業"},{"subitem_text_value":"住友電気工業"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information Science, Faculty of Science, University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Science, Faculty of Science, University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Sumitomo Electric Industries, Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Sumitomo Electric Industries, Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Sumitomo Electric Industries, Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Sumitomo Electric Industries, Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Sumitomo Electric Industries, Ltd.","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/32414/files/IPSJ-AL94040012.pdf"},"date":[{"dateType":"Available","dateValue":"1996-07-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL94040012.pdf","filesize":[{"value":"1.4 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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"20481997-d260-4d82-9952-6abd424318b3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1994 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"池田, 崇博"},{"creatorName":"今井, 浩"},{"creatorName":"西村, 茂樹"},{"creatorName":"下浦, 弘"},{"creatorName":"橋本, 武夫"},{"creatorName":"天目, 健二"},{"creatorName":"三藤, 邦彦"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takahiro, Ikeda","creatorNameLang":"en"},{"creatorName":"Hiroshi, Imai","creatorNameLang":"en"},{"creatorName":"Shigeki, Nishimura","creatorNameLang":"en"},{"creatorName":"Hiroshi, Shimoura","creatorNameLang":"en"},{"creatorName":"Takeo, Hahimoto","creatorNameLang":"en"},{"creatorName":"Kenji, Tenmoku","creatorNameLang":"en"},{"creatorName":"Kunihiko, Mitoh","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"最短路問題は、あらゆる分野での応用が考えられる最も基本的な問題の1つであり、近年急速に普及しつつある経路誘導システムとも深いつながりを持っている。本研究では、2点間の最短路問題に関して、ダイクストラ法・A^*・アルゴリズム・両方向探索といった従来のアルゴリズムを概観し、新しい手法に基づくA両方向探索アルゴリズムを提案する。また、実際の道路網のデータにこのアルゴリズムを適用した結果を基に、実際の効率及び特徴について論じる。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The shortest path problem is one of the most fundamental problems applicable in various fields, and has close relation to route navigation systems. This paper surveys algorithms for the two-terminal shortest path problem such as the Dijkstra method, the A^* algorithm, and the bidirectional Dijkstra method and proposes bidirectional A^* algorithm based on a new approach. The efficiency and the property of these algorithms are discussed through experiments applying them to an actual road network.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"96","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"89","bibliographicIssueDates":{"bibliographicIssueDate":"1994-07-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"69(1994-AL-040)","bibliographicVolumeNumber":"1994"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:01:30.644841+00:00","id":32414,"links":{}}