{"created":"2025-01-18T23:31:05.016059+00:00","updated":"2025-01-21T22:08:54.820577+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00072908","sets":["1164:2592:6240:6332"]},"path":["6332"],"owner":"10","recid":"72908","title":["Accelerating A<sup>*</sup> algorithms by sweeping out small-degree nodes"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-02-28"},"_buckets":{"deposit":"1d9d168a-c11d-4d95-aa7b-ff210af21fd1"},"_deposit":{"id":"72908","pid":{"type":"depid","value":"72908","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"Accelerating A<sup>*</sup> algorithms by sweeping out small-degree nodes","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Accelerating A<sup>*</sup> algorithms by sweeping out small-degree nodes"},{"subitem_title":"Accelerating A<sup>*</sup> algorithms by sweeping out small-degree nodes","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2011-02-28","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Informatics, Kyoto University."},{"subitem_text_value":"Graduate School of Informatics, Kyoto University."},{"subitem_text_value":"Graduate School of Informatics, Kyoto University."}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Informatics, Kyoto University.","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Informatics, Kyoto University.","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Informatics, Kyoto University.","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/72908/files/IPSJ-AL11134005.pdf"},"date":[{"dateType":"Available","dateValue":"2013-02-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL11134005.pdf","filesize":[{"value":"127.7 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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"dc77d8d8-444f-4222-af9d-168d5401b151","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Liang, Zhao"},{"creatorName":"Pipaporn, Eumthurapojn"},{"creatorName":"Hiroshi, Nagamochi"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Liang, Zhao","creatorNameLang":"en"},{"creatorName":"Pipaporn, Eumthurapojn","creatorNameLang":"en"},{"creatorName":"Hiroshi, Nagamochi","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":"A* is an algorithm framework for calculating point-to-point shortest paths. This paper gives a simple method to accelerate A* algorithms in practice by sweeping out small-degree nodes from the priority queue, which can reduce the running time of the queue operations and the distance estimations. Experiments show that our method is efficient in practice, especially for A* algorithms with a heavy estimation function such as the ALT algorithm (Goldberg and Harrelson, SODA 2005) and its time-dependent generalizations.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A* is an algorithm framework for calculating point-to-point shortest paths. This paper gives a simple method to accelerate A* algorithms in practice by sweeping out small-degree nodes from the priority queue, which can reduce the running time of the queue operations and the distance estimations. Experiments show that our method is efficient in practice, especially for A* algorithms with a heavy estimation function such as the ALT algorithm (Goldberg and Harrelson, SODA 2005) and its time-dependent generalizations.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"4","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2011-02-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2011-AL-134"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"id":72908,"links":{}}