JAIST Repository >
School of Information Science >
JAIST Research Reports >
Research Report - School of Information Science : ISSN 0918-7553 >
IS-RR-2015 >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/12611
|
Title: | Fault and Byzantine Tolerant Self-stabilizing Mobile Robots Gathering |
Authors: | Defago, Xavier Potop-Butucaru, Maria Gradinariu Stephane Messika, Julien Clement Raipin-Parvedy, Philippe |
Issue Date: | 2015-02-20 |
Publisher: | 北陸先端科学技術大学院大学情報科学研究科 |
Magazine name: | Research report (School of Information Science, Japan Advanced Institute of Science and Technology) |
Volume: | IS-RR-2015-003 |
Start page: | 1 |
End page: | 24 |
Abstract: | 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 |
Material Type: | publisher |
Appears in Collections: | IS-RR-2015
|
Files in This Item:
File |
Description |
Size | Format |
IS-RR-2015-003.pdf | | 453Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|