{"created":"2023-05-15T12:20:26.975187+00:00","id":11026,"links":{},"metadata":{"_buckets":{"deposit":"e4dde548-6150-481c-81fd-14c490514f08"},"_deposit":{"created_by":1,"id":"11026","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"11026"},"status":"published"},"_oai":{"id":"oai:kansai-u.repo.nii.ac.jp:00011026","sets":["528:1538:1585"]},"author_link":["23569","23566","23572","23573","23568","23567","23571","23570"],"item_7_alternative_title_22":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Attributes-dependent Route Generation Scheme Using Network Voronoi Diagrams"}]},"item_7_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2007-02-24","bibliographicIssueDateType":"Issued"},"bibliographic_titles":[{}]}]},"item_7_description_34":{"attribute_name":"スポンサー","attribute_value_mlt":[{"subitem_description":"正式版リンクwww.ieice.org/~de/DEWS/DEWS2007/pdf/c8-5.pdf","subitem_description_type":"Other"}]},"item_7_description_4":{"attribute_name":"概要","attribute_value_mlt":[{"subitem_description":"近年，カーナビゲーションや歩行者ナビゲーション端末が広く普及しており，最短経路を求めるだけでなく，利用者の好みや空間状況に応じた最適経路を導くための研究がなされている．従来手法では，特定経路のコストを調整することで，利用者が指定する道路上の特定範囲をなるべく通過する経路を導くものが多く，調整のために統計調査を必要とする．そこで本稿では，指定範囲の経路コスト調整せずに，指定範囲をより多く通過する経路を導く手法を提案する．指定範囲を中心とした部分グラフを生成し，A*最短経路探索アルゴリズムを用いて経路を求める手法である．具体的な仕組みは，ボロノイ図による母点間の近傍関係から，ドロネー図を生成する仕組みを応用し，グラフ上でネットワークボロノイ図を用いることで指定範囲を中心とした部分グラフを生成する．部分グラフ上のA*最短経路探索結果に含まれる指定範囲部分が，基本グラフ上の最短経路探索の結果よりも多く含まれることを，実空間道路情報を用いて示す．また，部分グラフを用いることで経路探索ステップ数の減少も確認する．","subitem_description_type":"Other"}]},"item_7_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"DEWS2007 c8-5 電子情報通信学会 第18回データ工学ワークショップ 2007年2月28日～2007年3月2日","subitem_description_type":"Other"}]},"item_7_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"23570","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Kibe, Hiroaki"}]},{"nameIdentifiers":[{"nameIdentifier":"23571","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Kambara, Tomoya"}]},{"nameIdentifiers":[{"nameIdentifier":"23572","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Ohnishi, Masaaki"}]},{"nameIdentifiers":[{"nameIdentifier":"23573","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Ueshima, Shinichi"}]}]},"item_7_publisher_36":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"電子情報通信学会"}]},"item_7_version_type_19":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"木部, 宏昭"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"蒲原, 智也"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"大西, 真晶"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"上島, 紳一"}],"nameIdentifiers":[{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-05-22"}],"displaytype":"detail","filename":"KU-1100-20070224-1.pdf","filesize":[{"value":"603.3 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KU-1100-20070224-1.pdf","url":"https://kansai-u.repo.nii.ac.jp/record/11026/files/KU-1100-20070224-1.pdf"},"version_id":"7488acf3-3241-4c28-b6e1-889dba457e95"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ボロノイ図","subitem_subject_scheme":"Other"},{"subitem_subject":"経路検索","subitem_subject_scheme":"Other"},{"subitem_subject":"部分グラフ","subitem_subject_scheme":"Other"},{"subitem_subject":"GIS","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"conference paper","resourceuri":"http://purl.org/coar/resource_type/c_5794"}]},"item_title":"ネットワークボロノイ図を用いた指定範囲を結ぶ経路の生成および評価","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ネットワークボロノイ図を用いた指定範囲を結ぶ経路の生成および評価"}]},"item_type_id":"7","owner":"1","path":["1585"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-07-05"},"publish_date":"2011-07-05","publish_status":"0","recid":"11026","relation_version_is_last":true,"title":["ネットワークボロノイ図を用いた指定範囲を結ぶ経路の生成および評価"],"weko_creator_id":"1","weko_shared_id":1},"updated":"2023-05-15T14:39:48.673994+00:00"}