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

三维混合可编程物质的通用涂层

Universal Coating by 3D Hybrid Programmable Matter

Irina Kostitsyna, David Liedtke, Christian Scheideler

AI总结:

研究混合可编程物质三维模型中的涂层问题,提出一种确定性有限自动机智能体算法,通过单一及常数种瓦片类型实现表面图填充,算法复杂度为$\mathcal{O}(n^2)$步且最坏情况最优。

摘要:

受在纳米尺度辅助人体生理功能的纳米机器人前景的启发,我们研究了混合可编程物质三维模型中的涂层问题。在此模型中,一个具有严格受限视野且具备确定性有限自动机计算能力的单一智能体,可通过拾取、移动并将瓦片放置于某处来操作被动瓦片。涂层问题的目标是用瓦片填充大小为$n$的某表面图的每个节点。我们首先用单一瓦片类型在受限图类上解决该问题,随后使用常数种瓦片类型在捕获三维物体表面的特定表面图中编码该图。我们的算法需要$\mathcal{O}(n^2)$步,与具全局知识且无内存限制的智能体相比,这是最坏情况最优的。

英文摘要:

Motivated by the prospect of nano-robots that assist human physiological functions at the nanoscale, we investigate the coating problem in the three-dimensional model for hybrid programmable matter. In this model, a single agent with strictly limited viewing range and the computational capability of a deterministic finite automaton can act on passive tiles by picking up a tile, moving, and placing it at some spot. The goal of the coating problem is to fill each node of some surface graph of size $n$ with a tile. We first solve the problem on a restricted class of graphs with a single tile type, and then use constantly many tile types to encode this graph in certain surface graphs capturing the surface of 3D objects. Our algorithm requires $\mathcal{O}(n^2)$ steps, which is worst-case optimal compared to an agent with global knowledge and no memory restrictions.

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

↑