{"updated":"2025-01-20T19:44:21.429119+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00113214","sets":["1164:2592:7834:7891"]},"path":["7891"],"owner":"11","recid":"113214","title":["重みつき障害物を含む平面上での最短経路アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-02-24"},"_buckets":{"deposit":"35d8c3a0-4393-4535-a5b4-33cfcd1234cf"},"_deposit":{"id":"113214","pid":{"type":"depid","value":"113214","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"重みつき障害物を含む平面上での最短経路アルゴリズム","author_link":["37318","37319","37317","37316"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"重みつき障害物を含む平面上での最短経路アルゴリズム"}]},"item_type_id":"4","publish_date":"2015-02-24","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"北陸先端科学技術大学院大学"},{"subitem_text_value":"北陸先端科学技術大学院大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Japan Advanced Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Japan Advanced Institute of Science and 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/113214/files/IPSJ-AL15152008.pdf"},"date":[{"dateType":"Available","dateValue":"2017-02-24"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL15152008.pdf","filesize":[{"value":"6.9 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":"63b4087c-a577-4edd-a108-5564a7afe313","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2015 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":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuma, Hayakawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tetsuo, Asano","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":"近年では社会の複雑化に伴って，より巨大なグラフに対する最短経路問題の解決が求められるようになってきている．しかし，巨大なグラフに対する最短経路問題を実際に計算機上で解くためには，グラフの大きさに比例した多くのメモリが必要になる．本研究では，平面上の最短経路問題を解く実用的でメモリ効率の良いアルゴリズムの開発を行う．また，現場では障害物をある対価を払って通過することがあり，そのような障害物に重みがついている場合への拡張も行う．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Recently, finding a shortest path in a big graph is required as society becomes complex. However, it requires huge memory proportional to the size of the graph when we use a computer to solve it. In this paper, we propose an efficient and practical memory constraint algorithm that solves the shortest path problem on a plane. It can be extended to the case that when obstacle has its cost, and a field robot can pass it with paying the cost.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2015-02-24","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"2015-AL-152"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:54:50.411114+00:00","id":113214,"links":{}}