自动机的堡垒形成
Fort Formation by an Automaton
摘要:
用低性能机器人建造建筑物是最近的研究发展。机器人(或移动代理)被设计为确定性有限自动机。目标是从无限网格$Z\times Z$中给定的材料分布(\textit{bricks})制作结构。网格单元可以包含块(\textit{full cells}),也可以是空的(\textit{empty cells})。由全单元诱导的子图\textit{field}最初是连接的。在给定的时间点,机器人最多只能搬运一块砖。该机器人可以从\textit{full cell}开始向四个方向(北、东、南和西)移动。最远的全单元格之间的\textit{Manhattan distance}是字段的\textit{span}。我们考虑建造一个\textit{fort},一个具有最小跨度和最大覆盖面积的结构。在正方形网格上,堡垒是一个中空的矩形,周边是砖块。我们表明,这样一个堡垒的建设可以在$O(z^2)$时间-与匹配的下限$Ω(z^2)$ -其中$z$是在环境中存在的砖的数量。
英文摘要:
Building structures by low capability robots is a very recent research development. A robot (or a mobile agent) is designed as a deterministic finite automaton. The objective is to make a structure from a given distribution of materials (\textit{bricks}) in an infinite grid $Z\times Z$. The grid cells may contain a brick (\textit{full cells}) or it may be empty (\textit{empty cells}). The \textit{field}, a sub-graph induced by the full cells, is initially connected. At a given point in time, a robot can carry at most one brick. The robot can move in four directions (north, east, south, and west) and starts from a \textit{full cell}. The \textit{Manhattan distance} between the farthest full cells is the \textit{span} of the field. We consider the construction of a \textit{fort}, a structure with the minimum span and maximum covered area. On a square grid, a fort is a hollow rectangle with bricks on the perimeter. We show that the construction of such a fort can be done in $O(z^2)$ time -- with a matching lower bound $Ω(z^2)$ -- where $z$ is the number of bricks present in the environment.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。