arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.5817cs.DC
收藏

具有同名词的机器人网络:模式形成的情况

Robot Networks with Homonyms: The Case of Patterns Formation

Zohir Bouzid, Anissa Lamani

摘要:

在本文中,我们考虑的问题,形成一系列的几何图案[4]由一个网络的遗忘移动机器人,只通过视觉通信。到目前为止,这个问题已经在模型中进行了研究,其中机器人要么被假设为具有不同的标识符,要么是完全匿名的。为了推广这些结果并更好地理解匿名性如何影响机器人的计算能力,我们在最近在[5]中引入的新模型中研究了这个问题,其中n个机器人可以共享多达1 <= h <= n个不同的标识符。我们目前的必要和充分条件,相关的同源性和同音异义,使问题可解。我们还表明,在h = n的情况下,使机器人的标识符不可见并不限制他们的计算能力。这与[4]的一个结果相矛盾。为了介绍我们的算法,我们使用一个函数,计算许多规则和对称配置的韦伯点。这个函数本身就很有趣,因为到目前为止,只有少数其他模式解决了寻找韦伯点的问题。

英文摘要:

In this paper, we consider the problem of formation of a series of geometric patterns [4] by a network of oblivious mobile robots that communicate only through vision. So far, the problem has been studied in models where robots are either assumed to have distinct identifiers or to be completely anonymous. To generalize these results and to better understand how anonymity affects the computational power of robots, we study the problem in a new model, introduced recently in [5], in which n robots may share up to 1 <= h <= n different identifiers. We present necessary and sufficient conditions, relating symmetricity and homonymy, that makes the problem solvable. We also show that in the case where h = n, making the identifiers of robots invisible does not limit their computational power. This contradicts a result of [4]. To present our algorithms, we use a function that computes the Weber point for many regular and symmetric configurations. This function is interesting in its own right, since the problem of finding Weber points has been solved up to now for only few other patterns.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑