JAIST Repository >
b. 情報科学研究科・情報科学系 >
b30. リサーチレポート >
Research Report - School of Information Science : ISSN 0918-7553 >
IS-RR-2005 >

このアイテムの引用には次の識別子を使用してください: http://hdl.handle.net/10119/4790

タイトル: Eventually consistent compasses for robust gathering of asynchronous mobile robots with limited visibility
著者: Souissi, Samia
Defago, Xavier
Yamashita, Masafumi
キーワード: Mobile computing
Distributed algorithms
Robots
Unreliable compasses
Oblivious computations
Limited Visibility
Self-stabilization
発行日: 2005-07-20
出版者: 北陸先端科学技術大学院大学情報科学研究科
誌名: Research report (School of Information Science, Japan Advanced Institute of Science and Technology)
巻: IS-RR-2005-010
開始ページ: 1
終了ページ: 20
抄録: Reaching agreement among a set of mobile robots is one of the most fundamental issues in distributed robotic systems. This problem is often illustrated by the gathering problem, where the robots must self-organize to eventually meet at some arbitrary location. That problem has the advantage that, while being very simple to express, it retains the inherent difficulty of agreement, namely the problem of breaking symmetry. In their fully asynchronous model with oblivious robots and limited visibility, Flocchini et al. [7] show that gathering is solvable, as long as the robots share the knowledge of some direction, as provided by a compass. It turns out that, in robotic systems, compasses are devices that are often subject to instabilities. In this paper, we thus define a model with unreliable compasses and, focusing on the gathering problem, show that the algorithm of Flocchini et al. is unable to tolerate unstable compasses. We then give a gathering algorithm that solves the problem in a system where compasses are unstable for some arbitrary long periods, provided that they stabilize eventually.
URI: http://hdl.handle.net/10119/4790
資料タイプ: publisher
出現コレクション:IS-RR-2005

このアイテムのファイル:

ファイル 記述 サイズ形式
IS-RR-2005-010.pdf284KbAdobe PDF見る/開く

当システムに保管されているアイテムはすべて著作権により保護されています。

 


お問い合わせ先 : 北陸先端科学技術大学院大学 研究推進課図書館情報係