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. 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.
翻译:在关于自主机器人群的相互可见问题的现有文献中,被采纳的可见模型有一些与实际遥感装置实施不相符的理想假设。本文调查了更现实的可见模型中的问题,该模型称为不透明的脂肪机器人,使用微软的全向照相机。机器人的模型是单位磁盘,每个机器人的全向照相机代表一个较小尺寸的磁盘。我们假设机器人有指南,可以就本地协调系统两轴的方向和方向达成一致。机器人配备了可见的灯光,作为通信媒介和记忆的一种形式。我们为半同步环境下的相互可见问题提出了一个分布式算法。我们的算法还为领导人选举提供了一种解决办法,我们在主要算法中使用了这种办法作为次路径。虽然领导人选举在全可见模型中有两个轴式协议是微不足道的,但在我们的情况中却具有挑战性,而且具有独立的兴趣。