On the Feasibility of Gathering by Autonomous Mobile Robots
On the Feasibility of Gathering by Autonomous Mobile Robots
复制标题
论自主移动机器人采集的可行性
DOI：
10.1007/11429647_20
复制
发表时间：
2005
影响因子：
3.3
通讯作者：
G. Prencipe
中科院分区：
文献类型：
--
作者：
G. Prencipe
给定一组n个可以在二维平面上自由移动的自主移动机器人，要求它们在平面的一个事先不固定的位置集合（集合问题）。本文主要研究的问题是：机器人在什么条件下可以完成这项任务？所研究的机器人非常简单：它们是匿名的，完全异步的，它们对过去的计算没有任何记忆，它们之间不能明确地通信。我们表明，这个简单的任务通常不能由考虑的机器人系统完成。
Given a set of n autonomous mobile robots that can freely move on a two dimensional plane, they are required to gather in a position of the plane not fixed in advance (Gathering Problem). The main research question we address in this paper is: under which conditions this task can be accomplished by the robots? The studied robots are quite simple: they are anonymous, totally asynchronous, they do not have any memory of past computations, they cannot explicitly communicate among each other. We show that this simple task cannot be in general accomplished by the considered system of robots.