Brief Announcement: Gathering Despite Defected View

Abstract

In this paper, we provide a new perspective on the observation by robots; a robot cannot necessarily observe all other robots regardless of distances to them. We introduce a new computational model with defected views called a ( N , k )-defected model where k robots among N − 1 other robots can be observed. We propose two gathering algorithms: one in the adversarial ( N , N − 2)-defected model for N ≥ 5 (where N is the number of robots) and the other in the distance-based (4,2)-defected model. Moreover, we present two impossibility results for a (3,1)-defected model and a relaxed ( N , N − 2)-defected model respectively. This announcement is short; the full paper is available at [1].