无限正则Tessellation图上任意模式的生成
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs
摘要:
给定一组R机器人,每个机器人位于一个无限规则的镶嵌图的不同顶点,我们的目标是探索任意模式形成(APF)问题。给定一个网格顶点的多重集合F,使得|R| = |F|,APF要求一个分布式算法来移动机器人,以便达到类似于F的配置。相似性意味着机器人必须被配置为F,而不管平移、旋转、反射。到目前为止,作为可能的图形离散欧几里德平面只有标准的正方形网格已被认为是在经典的Look-Compute-Move模型的背景下。然而,自然也要考虑其他规则的镶嵌图,即三角形和六边形网格。我们提供了一个解决算法的APF时,初始配置是不对称的,所考虑的拓扑结构是任何规则的镶嵌图。
英文摘要:
Given a set R of robots, each one located at different vertices of an infinite regular tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem. Given a multiset F of grid vertices such that |R|=|F|, APF asks for a distributed algorithm that moves robots so as to reach a configuration similar to F. Similarity means that robots must be disposed as F regardless of translations, rotations, reflections. So far, as possible graph discretizing the Euclidean plane only the standard square grid has been considered in the context of the classical Look-Compute-Move model. However, it is natural to consider also the other regular tessellation graphs, that are triangular and hexagonal grids. We provide a resolution algorithm for APF when the initial configuration is asymmetric and the considered topology is any regular tessellation graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。