Gathering autonomous mobile robots with dynamic compasses: an optimal result

  • Authors:

  • Taisuke Izumi;Yoshiaki Katayama;Nobuhiro Inuzuka;Koichi Wada

  • Affiliations:

  • Nagoya Institute of Technology, Nagoya, Aichi, Japan;Nagoya Institute of Technology, Nagoya, Aichi, Japan;Nagoya Institute of Technology, Nagoya, Aichi, Japan;Nagoya Institute of Technology, Nagoya, Aichi, Japan

  • Venue:
  • DISC'07 Proceedings of the 21st international conference on Distributed Computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let consider n autonomous mobile robots that can move in a two dimensional plane. The gathering problem is one of the most fundamental tasks of autonomous mobile robots. In short, given a set of robots with arbitrary initial locations, gathering must make all robots meet in finite time at a point that is not predefined. In this paper, we study about the feasibility of gathering by mobile robots that have ϕ-absolute error dynamic compasses. While the direction of each local coordinate system is fixed in usual systems, the dynamic compass model allows the angle difference between a local coordinate system and the global coordinate system to vary with time in the range of [0, ϕ]. This paper proposes a semi-synchronous gathering algorithm for n robots with (π/2-ε)-absolute error dynamic compasses, where ε is an arbitrary small constant larger than zero. To the best of our knowledge, the proposed algorithm is the first one that considers both inaccurate compass models and more than two robots. We also show the optimality of our algorithm. It is proved that for any ϕ ≥ π/2, there is no algorithm to gather two robots with ϕ-absolute error dynamic compasses.