{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00213778","sets":["1164:2592:10486:10744"]},"path":["10744"],"owner":"44499","recid":"213778","title":["移動コスト最小化に基づくマルチエージェント監視"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-11-11"},"_buckets":{"deposit":"fe09d684-c3f6-45b7-98e9-27cfe7967b6e"},"_deposit":{"id":"213778","pid":{"type":"depid","value":"213778","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"移動コスト最小化に基づくマルチエージェント監視","author_link":["547382","547378","547377","547379","547380","547381"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"移動コスト最小化に基づくマルチエージェント監視"},{"subitem_title":"Multi-Agent Surveillance Based on Travel Cost Minimization","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2021-11-11","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":" Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":" Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":" Hokkaido University","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/213778/files/IPSJ-AL21185017.pdf","label":"IPSJ-AL21185017.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL21185017.pdf","filesize":[{"value":"1.5 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"22d6c515-f084-45cf-8c6a-a92d6f86b5e9","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"村形, 恭平"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"小林, 孝一"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"山下, 裕"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kyohei, Murakata","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Koichi, Kobayashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yuh, Yamashita","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文では，複数エージェントによる監視問題を考える．監視領域は有向グラフでモデル化されているとする．このとき，監視性能に関する制約のもとで移動コストを最小化する問題を考える．この問題は混合整数線形計画（MILP）問題に帰着される．MILP 問題を各時刻で解くことで，持続的な監視が可能になる．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we consider the surveillance problem by multiple agents. A surveillance area is modeled by a directed graph. Then, we consider the problem of minimizing the travel cost under constraints on the surveillance performance. This problem is reduced to a mixed integer linear programming (MILP) problem. Persistent surveillance can be achieved by solving the MILP problem at each time.","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":"2021-11-11","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"17","bibliographicVolumeNumber":"2021-AL-185"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:14:37.540589+00:00","updated":"2025-01-19T17:01:38.054428+00:00","id":213778}