WEKO3
アイテム
Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings
http://hdl.handle.net/10228/00008810
http://hdl.handle.net/10228/00008810178a3efa-a618-45f3-a350-f5318e34e8c7
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
j.tcs.2020.04.002.pdf (640.6 kB)
|
|
| Item type | 学術雑誌論文 = Journal Article(1) | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2022-04-18 | |||||||||||||
| 資源タイプ | ||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||
| 資源タイプ | journal article | |||||||||||||
| タイトル | ||||||||||||||
| タイトル | Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings | |||||||||||||
| 言語 | en | |||||||||||||
| 言語 | ||||||||||||||
| 言語 | eng | |||||||||||||
| 著者 |
柴田, 将拡
× 柴田, 将拡
WEKO
25091
× Kawata, Norikazu× Sudo, Yuichi× Ooshita, Fukuhito× Kakugawa, Hirotsugu× Masuzawa, Toshimitsu |
|||||||||||||
| 抄録 | ||||||||||||||
| 内容記述タイプ | Abstract | |||||||||||||
| 内容記述 | In this paper, we consider the partial gathering problem of mobile agents in asynchronous unidirectional ring networks. The partial gathering problem is a generalization of the (well-investigated) total gathering problem, which requires that all the k agents distributed in the network terminate at a single node. The partial gathering problem requires, for a given positive integer g(<k), that all the agents terminate in a configuration such that either at least g agents or no agent exists at each node. The requirement for the partial gathering problem is strictly weaker than that for the total gathering problem, and thus it is interesting to clarify the difference on the move complexity between them. In this paper, we aim to solve the partial gathering problem for agents without identifiers or any global knowledge such as the number k of agents or the number n of nodes. We consider deterministic and randomized cases. First, in the deterministic case, we show that the set of unsolvable initial configurations is the same as that for the case of agents with knowledge of k. In addition, we propose an algorithm that solves the problem from any solvable initial configuration in a total number of O(gn) moves. Next, in the randomized case, we propose an algorithm that solves the problem in a total number of O(gn) moves in expectation from any initial configuration. Note that g<k holds and agents require a total number of Ω(gn) (resp., Ω(kn)) moves to solve the partial (resp., total) gathering problem. Thus, our algorithms can solve the partial gathering problem in asymptotically optimal total number of moves without identifiers or global knowledge, and the total number of O(gn) moves is strictly smaller than that for the total gathering problem. | |||||||||||||
| 言語 | en | |||||||||||||
| 書誌情報 |
en : Theoretical Computer Science 巻 822, p. 92-109, 発行日 2020-04-16 |
|||||||||||||
| 出版社 | ||||||||||||||
| 出版者 | Elsevier | |||||||||||||
| DOI | ||||||||||||||
| 関連タイプ | isVersionOf | |||||||||||||
| 識別子タイプ | DOI | |||||||||||||
| 関連識別子 | https://doi.org/10.1016/j.tcs.2020.04.002 | |||||||||||||
| 日本十進分類法 | ||||||||||||||
| 主題Scheme | NDC | |||||||||||||
| 主題 | 547 | |||||||||||||
| NCID | ||||||||||||||
| 収録物識別子タイプ | NCID | |||||||||||||
| 収録物識別子 | AA00862688 | |||||||||||||
| ISSN | ||||||||||||||
| 収録物識別子タイプ | EISSN | |||||||||||||
| 収録物識別子 | 1879-2294 | |||||||||||||
| ISSN | ||||||||||||||
| 収録物識別子タイプ | PISSN | |||||||||||||
| 収録物識別子 | 0304-3975 | |||||||||||||
| 著作権関連情報 | ||||||||||||||
| 権利情報 | Copyright (c) 2020 Elsevier B.V. All rights reserved. | |||||||||||||
| キーワード | ||||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | Distributed system | |||||||||||||
| キーワード | ||||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | Mobile agent | |||||||||||||
| キーワード | ||||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | Gathering problem | |||||||||||||
| キーワード | ||||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | Partial gathering problem | |||||||||||||
| 出版タイプ | ||||||||||||||
| 出版タイプ | AM | |||||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||||||||
| 査読の有無 | ||||||||||||||
| 値 | yes | |||||||||||||
| 研究者情報 | ||||||||||||||
| URL | https://hyokadb02.jimu.kyutech.ac.jp/html/100001003_ja.html | |||||||||||||
| 論文ID（連携） | ||||||||||||||
| 値 | 10355208 | |||||||||||||
| 連携ID | ||||||||||||||
| 値 | 8249 | |||||||||||||
