|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b30. リサーチレポート >
Research Report - School of Information Science ： ISSN 0918-7553 >
IS-RR-2015 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/12611
|
| タイトル: | Fault and Byzantine Tolerant Self-stabilizing Mobile Robots Gathering |
| 著者: | Defago, Xavier
Potop-Butucaru, Maria Gradinariu
Stephane Messika, Julien Clement
Raipin-Parvedy, Philippe |
| 発行日: | 2015-02-20 |
| 出版者: | 北陸先端科学技術大学院大学情報科学研究科 |
| 誌名: | Research report (School of Information Science, Japan Advanced Institute of Science and Technology) |
| 巻: | IS-RR-2015-003 |
| 開始ページ: | 1 |
| 終了ページ: | 24 |
| 抄録: | Gathering is a fundamental coordination problem in cooperative mobile robotics. In short, given a set of robots with arbitrary initial locations and no initial agreement on a global coordinate system, gathering requires that all robots, following their algorithm, reach the exact same but not predetermined location. Gathering is particularly challenging in networks where robots are oblivious (i.e., stateless) and direct communication is replaced by observations on their respective locations. Interestingly any algorithm that solves gathering with oblivious robots is inherently self-stabilizing if no specific assumption is made on the initial distribution of the robots. In this paper, we significantly extend the studies of deterministic gathering feasibility under different assumptions related to synchrony and faults (crash and Byzantine). Unlike prior work, we consider a larger set of scheduling strategies, such as bounded schedulers. In addition, we extend our study to the feasibility of probabilistic self-stabilizing gathering in both fault-free and fault-prone environments. |
| URI: | http://hdl.handle.net/10119/12611 |
| 資料タイプ: | publisher |
| 出現コレクション: | IS-RR-2015
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| IS-RR-2015-003.pdf | | 453Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
