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 [Yonghwan Kim and others, 2022].
@InProceedings{kim_et_al:LIPIcs.DISC.2022.46, author = {Kim, Yonghwan and Shibata, Masahiro and Sudo, Yuichi and Nakamura, Junya and Katayama, Yoshiaki and Masuzawa, Toshimitsu}, title = {{Brief Announcement: Gathering Despite Defected View}}, booktitle = {36th International Symposium on Distributed Computing (DISC 2022)}, pages = {46:1--46:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-255-6}, ISSN = {1868-8969}, year = {2022}, volume = {246}, editor = {Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.46}, URN = {urn:nbn:de:0030-drops-172377}, doi = {10.4230/LIPIcs.DISC.2022.46}, annote = {Keywords: mobile robot, gathering, defected view model} }
Feedback for Dagstuhl Publishing