タイトル(掲載誌)Research report (School of Information Science, Japan Advanced Institute of Science and Technology)
一般注記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.
リサーチレポート(北陸先端科学技術大学院大学情報科学研究科)
identifier:https://dspace.jaist.ac.jp/dspace/handle/10119/4798
一次資料へのリンクURLhttps://dspace.jaist.ac.jp/dspace/bitstream/10119/4798/1/IS-RR-2007-006.pdf
連携機関・データベース国立情報学研究所 : 学術機関リポジトリデータベース(IRDB)(機関リポジトリ)
提供元機関・データベース北陸先端科学技術大学院大学 : JAIST学術研究成果リポジトリ