Mutual visibility by fat robots with slim omnidirectional camera

Article Type

Research Article

Publication Title

Journal of Parallel and Distributed Computing

Abstract

In the existing literature of the MUTUAL VISIBILITY problem for autonomous robot swarms, the adopted visibility models have some idealistic assumptions that are not consistent with practical sensing device implementations. This paper investigates the problem in the more realistic visibility model called opaque fat robots with slim omnidirectional camera. The robots are modeled as unit disks, each having an omnidirectional camera represented as a disk of smaller size. The region obstructed by a single robot in this model is a truncated infinite cone. This makes the visibility model significantly challenging compared to the previous ones. We assume that the robots have compasses that allow agreement in the direction and orientation of both axes of their local coordinate systems. The robots are equipped with visible lights which serve as a medium of communication and also as a form of memory. We present a distributed algorithm for the MUTUAL VISIBILITY problem which is provably correct in the semi-synchronous setting. Our algorithm also provides a solution for LEADER ELECTION which we use as a subroutine in our main algorithm. Although LEADER ELECTION is trivial with two axis agreement in the full visibility model, it is challenging in our case and is of independent interest.

DOI

https://10.1016/j.jpdc.2023.104716

Publication Date

10-1-2023

Comments

Open Access, Green

This document is currently not available here.

Share

COinS