可编程物质的凸包形成
Convex Hull Formation for Programmable Matter
AI总结:
本文提出一种分布式局部算法,使粒子系统自组织形成物体的凸包,并可在相同渐近时间内扩展为弱O-壳,该算法首次在严格局部感知、常量内存和无共享方向或坐标的条件下实现分布式凸包计算。
摘要:
我们将可编程物质设想为纳米级代理(称为粒子)的系统,这些代理具有非常有限的计算能力,通过集体移动和计算来实现期望目标。我们使用几何变形虫模型作为计算框架,该模型假设粒子在三角形格点上移动。受使用最少资源密封物体问题的启发,我们展示了粒子系统如何自组织形成物体的凸包。我们给出了一种分布式局部算法用于凸包形成,并证明它在$\mathcal{O}(B)$异步轮次内运行,其中$B$是物体边界的长度。在相同的渐近运行时间内,该算法可以扩展为形成物体的(弱)$\mathcal{O}$-壳,它使用相同数量的粒子但最小化壳包围的面积。我们的算法是首个由具有严格局部感知、常量内存且无共享方向或坐标的分布式实体计算凸包的算法。这也是首个计算受限方向凸包的分布式方法。该方法涉及协调粒子作为分布式内存;因此,作为一个支持性但独立的结果,我们提出并分析了一种算法,用于将具有常量内存的粒子组织为分布式二进制计数器,该计数器在粒子移动时也能高效支持递增、递减和零测试。
英文摘要:
We envision programmable matter as a system of nano-scale agents (called particles) with very limited computational capabilities that move and compute collectively to achieve a desired goal. We use the geometric amoebot model as our computational framework, which assumes particles move on the triangular lattice. Motivated by the problem of sealing an object using minimal resources, we show how a particle system can self-organize to form an object's convex hull. We give a distributed, local algorithm for convex hull formation and prove that it runs in $\mathcal{O}(B)$ asynchronous rounds, where $B$ is the length of the object's boundary. Within the same asymptotic runtime, this algorithm can be extended to also form the object's (weak) $\mathcal{O}$-hull, which uses the same number of particles but minimizes the area enclosed by the hull. Our algorithms are the first to compute convex hulls with distributed entities that have strictly local sensing, constant-size memory, and no shared sense of orientation or coordinates. Ours is also the first distributed approach to computing restricted-orientation convex hulls. This approach involves coordinating particles as distributed memory; thus, as a supporting but independent result, we present and analyze an algorithm for organizing particles with constant-size memory as distributed binary counters that efficiently support increments, decrements, and zero-tests --- even as the particles move.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。