| Item type |
SIG Technical Reports(1) |
| 公開日 |
2020-05-02 |
| タイトル |
|
|
タイトル |
Gathering for mobile agents with a strong team in weakly Byzantine environments |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Gathering for mobile agents with a strong team in weakly Byzantine environments |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Graduate School of Science and Technology, Nara Institute of Science and Technology |
| 著者所属 |
|
|
|
Graduate School of Science and Technology, Nara Institute of Science and Technology |
| 著者所属 |
|
|
|
Information and Media Center, Toyohashi University of Technology |
| 著者所属 |
|
|
|
Graduate School of Science and Technology, Nara Institute of Science and Technology |
| 著者所属 |
|
|
|
Graduate School of Science and Technology, Nara Institute of Science and Technology |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Science and Technology, Nara Institute of Science and Technology |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Science and Technology, Nara Institute of Science and Technology |
| 著者所属(英) |
|
|
|
en |
|
|
Information and Media Center, Toyohashi University of Technology |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Science and Technology, Nara Institute of Science and Technology |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Science and Technology, Nara Institute of Science and Technology |
| 著者名 |
Jion, Hirose
Masashi, Tsuchida
Junya, Nakamura
Pukuhito, Ooshita
Michiko, Inoue
|
| 著者名(英) |
Jion, Hirose
Masashi, Tsuchida
Junya, Nakamura
Pukuhito, Ooshita
Michiko, Inoue
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
We study the gathering problem requiring a team of mobile agents to gatherat a single node in arbitrary networks. The team consists of k agents with unique identifiers (IDs), and f of them are weakly Byzantine agents, which behave arbitrarily except falsifying their identifiers. The agentsmove in synchronous rounds and cannot leave any information on nodes. If the number of nodes n is given to agents, the existing fastest algorithm tolerates any number of weakly Byzantine agents and achieves gathering with simultaneous termination in 0(n4 • |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
We study the gathering problem requiring a team of mobile agents to gatherat a single node in arbitrary networks. The team consists of k agents with unique identifiers (IDs), and f of them are weakly Byzantine agents, which behave arbitrarily except falsifying their identifiers. The agentsmove in synchronous rounds and cannot leave any information on nodes. If the number of nodes n is given to agents, the existing fastest algorithm tolerates any number of weakly Byzantine agents and achieves gathering with simultaneous termination in 0(n4 • |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AN1009593X |
| 書誌情報 |
研究報告アルゴリズム（AL）
巻 2020-AL-178,
号 8,
p. 1-8,
発行日 2020-05-02
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8566 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-AL20178008.pdf (717.7 kB)
