The Gathering Problem for Two Oblivious Robots with Unreliable Compasses


Anonymous mobile robots are often classified into synchronous, semi-synchronous and asynchronous robots when discussing the pattern formation problem. For semi-synchronous robots, all patterns formable with memory are also formable without memory, with the single exception of forming a point (i.e., the gathering) by two robots. (All patterns formable with memory are formable without memory for synchronous robots, and little is known for asynchronous robots.) However, the gathering problem for two semi-synchronous robots without memory (called oblivious robots in this paper) is trivially solvable when their local coordinate systems are consistent, and the impossibility proof essentially uses the inconsistencies in their coordinate systems. Motivated by this, this paper investigates the magnitude of consistency between the local coordinate systems necessary and sufficient to solve the gathering problem for two oblivious robots under semi-synchronous and asynchronous models. To discuss the magnitude of consistency, we assume that each robot is equipped with an unreliable compass, the bearings of which may deviate from an absolute reference direction, and that the local coordinate system of each robot is determined by its compass. We consider two families of unreliable compasses, namely, static compasses with (possibly incorrect) constant bearings, and dynamic compasses the bearings of which can change arbitrarily (immediately before a new look-compute-move cycle starts and after the last cycle ends). For each of the combinations of robot and compass models, we establish the condition on deviation φ that allows an algorithm to solve the gathering problem, where the deviation is measured by the largest angle formed between the x-axis of a compass and the reference direction of the global coordinate system: φ < π/2 for semi-synchronous and asynchronous robots with static compasses, φ < π/4 for semi-synchronous robots with dynamic compasses, and φ < π/6 for asynchronous robots with dynamiccompasses. Except for asynchronous robots with dynamic compasses, these sufficient conditions are also necessary. Preliminary versions of this paper appeared as: “Gathering autonomous mobile robots with dynamic compasses: An optimal result,” Proc. International Symposium on Distributed Computing, 298–312, 2007, “Gathering two stateless mobile robots using very inaccurate compasses in finite time,” Proc. International Conference on Robot Communication and Coordination, 48, 2007, and “Gathering problem of two asynchronous mobile robots with semidynamic compasses,” Proc. International Colloquium on Structural Information and Communication Complexity, 5–19, 2008. Graduate School of Engineering, Nagoya Institute of Technology, Gokiso-cho, Showa-ku, Nagoya, Aichi, 466-8555, Japan. Graduate School of Information Science, Japan Advanced Institute of Science and Technology (JAIST) 1-1 Asahidai, Tatsunokuchi, Nomigun Ishikawa 923-1292, Japan. Department of Informatics, Kyushu University 744, Motooka, Fukuoka, 819-0395, Japan. Corresponding Author. E-mail: Tel:+81-52-735-5567, Fax:+81-52-735-5408

DOI: 10.1137/100797916

Extracted Key Phrases

11 Figures and Tables

Citations per Year

Citation Velocity: 12

Averaging 12 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Izumi2012TheGP, title={The Gathering Problem for Two Oblivious Robots with Unreliable Compasses}, author={Taisuke Izumi and Samia Souissi and Yoshiaki Katayama and Nobuhiro Inuzuka and Xavier D{\'e}fago and Koichi Wada and Masafumi Yamashita}, journal={SIAM J. Comput.}, year={2012}, volume={41}, pages={26-46} }