可编程物质通用涂层的研制
On the Runtime of Universal Coating for Programmable Matter
摘要:
想象一下,用智能粒子(也被称为智能涂料)涂覆建筑物和桥梁,监测结构完整性,感知和报告交通和风荷载,从而产生可以更快、更便宜地完成此类检查工作并同时提高安全性的技术。在本文中,我们研究了自组织可编程物质背景下的任意形状物体的均匀涂层问题,即,可编程物质,由称为粒子的简单计算元素组成,可以建立和释放键,并可以以自组织的方式主动移动。粒子是匿名的,具有恒定大小的内存,并且只利用局部相互作用来覆盖对象。我们继续我们的通用涂层算法的研究,专注于其运行时分析,表明我们的算法终止在一个线性数量的轮具有很高的概率。我们还提出了一个匹配的线性下界,具有很高的概率。我们使用这个下界显示完全本地涂层算法和涂层算法之间的竞争差距的线性下界依赖于全局信息,这意味着我们的算法也是最佳的竞争意义上。仿真结果表明,在实际应用中,该算法的竞争比可能优于线性算法。
英文摘要:
Imagine coating buildings and bridges with smart particles (also coined smart paint) that monitor structural integrity and sense and report on traffic and wind loads, leading to technology that could do such inspection jobs faster and cheaper and increase safety at the same time. In this paper, we study the problem of uniformly coating objects of arbitrary shape in the context of self-organizing programmable matter, i.e., programmable matter which consists of simple computational elements called particles that can establish and release bonds and can actively move in a self-organized way. Particles are anonymous, have constant-size memory, and utilize only local interactions in order to coat an object. We continue the study of our Universal Coating algorithm by focusing on its runtime analysis, showing that our algorithm terminates within a linear number of rounds with high probability. We also present a matching linear lower bound that holds with high probability. We use this lower bound to show a linear lower bound on the competitive gap between fully local coating algorithms and coating algorithms that rely on global information, which implies that our algorithm is also optimal in a competitive sense. Simulation results show that the competitive ratio of our algorithm may be better than linear in practice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。