arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1111.2259cs.ROcs.MA
收藏

移动机器人开放问题综述

A Survey on Open Problems for Mobile Robots

University of Pisa(比萨大学)

Alberto Bandettini, Fabio Luporini, Giovanni Viglietta

摘要:

移动机器人的抓取是机器人研究中的一个重要课题。本文首先介绍了相关的研究工作,总结了模型和结果。然后,焦点转移到收集脂肪机器人的开放问题上。在这种情况下,“胖”意味着机器人不是用二维空间中的一个点来表示,而是有一个范围。此外,它可能是不透明的,在这个意义上,其他机器人不能“看穿”它。所有这些问题导致重新定义的原始问题和CORDA模型的扩展。对于最多4个机器人,文献中提供了一种算法,但对于n>4个胖机器人,收集总是可能的吗?另一个开放的问题被认为是:边界巡逻的移动机器人。一组只对速度和能见度有约束的移动机器人在有边界和可能有障碍物的多边形环境中工作。机器人必须进行永久运动(可能在环境中),以便最大限度地减少边界点不被任何机器人观察的时间跨度。

英文摘要:

Gathering mobile robots is a widely studied problem in robotic research. This survey first introduces the related work, summarizing models and results. Then, the focus shifts on the open problem of gathering fat robots. In this context, "fat" means that the robot is not represented by a point in a bidimensional space, but it has an extent. Moreover, it can be opaque in the sense that other robots cannot "see through" it. All these issues lead to a redefinition of the original problem and an extension of the CORDA model. For at most 4 robots an algorithm is provided in the literature, but is gathering always possible for n>4 fat robots? Another open problem is considered: Boundary Patrolling by mobile robots. A set of mobile robots with constraints only on speed and visibility is working in a polygonal environment having boundary and possibly obstacles. The robots have to perform a perpetual movement (possibly within the environment) so that the maximum timespan in which a point of the boundary is not being watched by any robot is minimized.

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

↑