|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b30. リサーチレポート >
Research Report - School of Information Science ： ISSN 0918-7553 >
IS-RR-2007 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4798
|
| タイトル: | Tight bound on the gathering of two oblivious mobile robots with inconsistent compasses |
| 著者: | Yamashita, Masafumi
Souissi, Samia
Defago, Xavier |
| キーワード: | Distributed Mobile Computing
Autonomous Robots
Cooperation and Control
Gathering
Tight Bound
Asynchrony
Inaccurate Compasses
Oblivious Computations |
| 発行日: | 2007-04-03 |
| 出版者: | 北陸先端科学技術大学院大学情報科学研究科 |
| 誌名: | Research report (School of Information Science, Japan Advanced Institute of Science and Technology) |
| 巻: | IS-RR-2007-006 |
| 開始ページ: | 1 |
| 終了ページ: | 15 |
| 抄録: | We consider a system of autonomous mobile robots that can move in the two dimensional space. These robots must gather, in finite time, at a single point in the plane, not predetermined (gathering problem). We consider that the robots are equipped with compasses, although these compasses can be inconsistent. In our previous work, we proposed an algorithm that gathers two oblivious mobile robots in finite time when the compasses diverge by at most 45°. In this paper, we extend this work by proving a tight bound on the degree of divergence of robots' compasses for solving the gathering problem. More specifically, we present a self-stabilizing algorithm to gather, in a finite time, two oblivious robots equipped with compasses that can differ by an angle strictly smaller than 180°, and we show that it is a tight bound. |
| URI: | http://hdl.handle.net/10119/4798 |
| 資料タイプ: | publisher |
| 出現コレクション: | IS-RR-2007
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| IS-RR-2007-006.pdf | | 734Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
