WEKO3
アイテム
Gathering of seven autonomous mobile robots on triangular grids
http://hdl.handle.net/10228/00008827
http://hdl.handle.net/10228/000088273c6211bb-ec0f-450a-be8f-18aa0fe0b0b5
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
RECN_2021-22.pdf (940.3 kB)
|
|
| アイテムタイプ | 学術雑誌論文 = Journal Article(1) | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2022-04-27 | |||||||||||||
| 資源タイプ | ||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||
| 資源タイプ | journal article | |||||||||||||
| タイトル | ||||||||||||||
| タイトル | Gathering of seven autonomous mobile robots on triangular grids | |||||||||||||
| 言語 | en | |||||||||||||
| 言語 | ||||||||||||||
| 言語 | eng | |||||||||||||
| 著者 |
柴田, 将拡
× 柴田, 将拡
WEKO
25091
× Ohyabu, Masaki× Sudo, Yuichi× Nakamura, Junya× Kim, Yonghwan× Katayama, Yoshiaki |
|||||||||||||
| 抄録 | ||||||||||||||
| 内容記述タイプ | Abstract | |||||||||||||
| 内容記述 | In this paper, we consider the gathering problem of seven autonomous mobile robots on triangular grids. The gathering problem requires that, starting from any connected initial configuration where a subgraph induced by all robot nodes (nodes where a robot exists) constitutes one connected graph, robots reach a configuration such that the maximum distance between two robots is minimized. For the case of seven robots, gathering is achieved when one robot has six adjacent robot nodes (they form a shape like a hexagon). In this paper, we aim to clarify the relationship between the capability of robots and the solvability of gathering on a triangular grid. In particular, we focus on visibility range of robots. To discuss the solvability of the problem in terms of the visibility range, we consider strong assumptions except for visibility range. Concretely, we assume that robots are fully synchronous and they agree on the direction and orientation of the x-axis, and chirality in the triangular grid. In this setting, we first consider the weakest assumption about visibility range, i.e., robots with visibility range 1. In this case, we show that there exists no collision-free algorithm to solve the gathering problem. Next, we extend the visibility range to 2. In this case, we show that our algorithm can solve the problem from any connected initial configuration. Thus, the proposed algorithm is optimal in terms of visibility range. | |||||||||||||
| 言語 | en | |||||||||||||
| 備考 | ||||||||||||||
| 内容記述タイプ | Other | |||||||||||||
| 内容記述 | 23rd Workshop on Advances in Parallel and Distributed Computational Models (APDCM2021), May 17, 2021, to be held in conjunction with 35th IEEE International Parallel and Distributed Processing Symposium (IPDPS2021), May 17-21, 2021, Portland, Oregon, USA | |||||||||||||
| 書誌情報 |
en : 2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) p. 566-575, 発行日 2021-06-24 |
|||||||||||||
| 出版社 | ||||||||||||||
| 出版者 | IEEE | |||||||||||||
| DOI | ||||||||||||||
| 関連タイプ | isVersionOf | |||||||||||||
| 識別子タイプ | DOI | |||||||||||||
| 関連識別子 | https://doi.org/10.1109/IPDPSW52791.2021.00090 | |||||||||||||
| ISBN | ||||||||||||||
| 識別子タイプ | ISBN | |||||||||||||
| 関連識別子 | 978-1-6654-3577-2 | |||||||||||||
| 日本十進分類法 | ||||||||||||||
| 主題Scheme | NDC | |||||||||||||
| 主題 | 501 | |||||||||||||
| 著作権関連情報 | ||||||||||||||
| 権利情報 | Copyright (c) 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | |||||||||||||
| キーワード | ||||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | distributed system | |||||||||||||
| キーワード | ||||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | mobile robot | |||||||||||||
| キーワード | ||||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | gathering problem | |||||||||||||
| キーワード | ||||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | triangular grid | |||||||||||||
| 会議記述 | ||||||||||||||
| 会議名 | 23rd Workshop on Advances in Parallel and Distributed Computational Models (APDCM2021), to be held in conjunction with 35th IEEE International Parallel and Distributed Processing Symposium (IPDPS2021) | |||||||||||||
| 言語 | en | |||||||||||||
| 開始年 | 2021 | |||||||||||||
| 開始月 | 05 | |||||||||||||
| 開始日 | 17 | |||||||||||||
| 終了年 | 2021 | |||||||||||||
| 終了月 | 05 | |||||||||||||
| 終了日 | 17 | |||||||||||||
| 開催地 | Portland, Oregon | |||||||||||||
| 言語 | en | |||||||||||||
| 開催国 | USA | |||||||||||||
| 出版タイプ | ||||||||||||||
| 出版タイプ | AM | |||||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||||||||
| 査読の有無 | ||||||||||||||
| 値 | yes | |||||||||||||
| 連携ID | ||||||||||||||
| 値 | 10280 | |||||||||||||
