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

粒子计算:设计世界来控制机器人群,只有全局信号

Particle Computation: Designing Worlds to Control Robot Swarms with only Global Signals

Rice University(莱斯大学);MIT(麻省理工学院);TU Braunschweig(布伦瑞克工业大学)

Aaron Becker, Erik D. Demaine, Sándor P. Fekete, James McLurkin

摘要:

微型和纳米机器人通常由全局输入信号控制,例如电磁场或重力场。这些场最大限度地移动每个机器人,直到它撞上一个固定的障碍物或另一个固定的机器人。本文研究了大群简单移动机器人(如细菌、传感器或智能建筑材料)的二维运动规划复杂性。在以前的工作中,我们证明了它是NP难的,以决定是否一个给定的初始配置可以转换成一个所需的目标配置,在本文中,我们证明了一个更强的结果:找到一个最优控制序列的问题是PSPACE完全的。从积极的方面来看,我们证明了我们可以通过设计障碍来构建有用的系统。我们提出了一个可重构的硬件平台,并演示了如何形成任意排列,并建立一个紧凑的绝对编码器。然后,我们采用相同的平台,并使用双轨逻辑来构建一个通用逻辑门,同时评估AND,NAND,NOR和OR运算。使用许多这样的门和适当的互连,我们可以评估任何逻辑表达式。

英文摘要:

Micro- and nanorobots are often controlled by global input signals, such as an electromagnetic or gravitational field. These fields move each robot maximally until it hits a stationary obstacle or another stationary robot. This paper investigates 2D motion-planning complexity for large swarms of simple mobile robots (such as bacteria, sensors, or smart building material). In previous work we proved it is NP-hard to decide whether a given initial configuration can be transformed into a desired target configuration; in this paper we prove a stronger result: the problem of finding an optimal control sequence is PSPACE-complete. On the positive side, we show we can build useful systems by designing obstacles. We present a reconfigurable hardware platform and demonstrate how to form arbitrary permutations and build a compact absolute encoder. We then take the same platform and use dual-rail logic to build a universal logic gate that concurrently evaluates AND, NAND, NOR and OR operations. Using many of these gates and appropriate interconnects we can evaluate any logical expression.

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

↑