{"updated":"2025-01-19T12:26:22.302119+00:00","links":{},"created":"2025-01-19T01:26:00.150142+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00226671","sets":["1164:5352:11207:11307"]},"path":["11307"],"owner":"44499","recid":"226671","title":["充電を考慮したマルチエージェント搬送問題"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-06-22"},"_buckets":{"deposit":"cd944086-63b7-4b4e-b178-df7c2faae914"},"_deposit":{"id":"226671","pid":{"type":"depid","value":"226671","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"充電を考慮したマルチエージェント搬送問題","author_link":["602398","602397","602401","602400","602399","602402"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"充電を考慮したマルチエージェント搬送問題"},{"subitem_title":"Multi-Agent Pickup, Delivery, and Charge","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"数理モデル化と問題解決1","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2023-06-22","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"株式会社豊田中央研究所"},{"subitem_text_value":"株式会社豊田中央研究所"},{"subitem_text_value":"株式会社豊田中央研究所"}]},"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/226671/files/IPSJ-BIO23074016.pdf","label":"IPSJ-BIO23074016.pdf"},"date":[{"dateType":"Available","dateValue":"2025-06-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-BIO23074016.pdf","filesize":[{"value":"1.7 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":"41"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"d87fde90-9e4c-4dec-9cf7-317f4c8614af","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 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":[{}]},{"creatorNames":[{"creatorName":"伊藤, 誠悟"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroya, Makino","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yoshihiro, Ohama","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Seigo, Ito","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12055912","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-8590","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"マルチエージェント経路計画問題の一種であるマルチエージェント搬送問題(Multi-Agent Pickup and Delivery，MAPD)は，複数のエージェントに対して集荷および配達からなるタスクを順次割り当て，衝突のない経路を探す問題である．エージェントが複数種類あり充放電速度が異なる場合，エージェントごとに充電周期が変わってくるので，手作業による充電計画は困難である．本論文では充電を考慮したMAPD，すなわちMulti-Agent Pickup，Delivery，and Charge (MAPDC)を定義し，また遺伝的アルゴリズムを用いた充電予約スケジューリングと，Token Passingを用いたタスク割り当てから構成されるアルゴリズムを提案する．シミュレーションによる評価の結果，ルールベースにより充電を行うベースラインと比較し，提案手法がバッテリー切れ回数の大幅な削減に寄与することを確認した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告バイオ情報学（BIO）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-06-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"16","bibliographicVolumeNumber":"2023-BIO-74"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":226671}