四维时空有效利用问题的可计算性分析
Analysis on the computability over the efficient utilization problem of the four-dimensional space-time
摘要:
本文形式化地提出了四维时空的有效利用问题。给定一个长方体容器,有限数量的刚性长方体物品,以及每个物品应该在容器中连续烘烤的时间长度,该问题要求安排每个物品被放置到容器中的开始时间,并安排每个物品在其连续烘烤期间的每个时刻的位置和取向,使得容器被利用的总时间长度尽可能短。在这里,容器和物品的所有侧面尺寸都是任意给定的正实数。与经典的装箱问题不同,每个物品在集装箱中的位置和方向都可以随时间变化。因此,根据上述数学模型,四维时空可以得到更真实、更充分的利用。本文证明了存在一个精确算法,可以通过有限次运算来解决这个问题,因此我们称这个问题是弱可计算的。基于对这种可计算性证明的理解,人们期望在不久的将来设计出有效的近似算法。对参数均为正实数的三维长方体装箱决策问题在一般自然情况下的弱可计算性进行了严格的证明。
英文摘要:
This paper formally proposes a problem about the efficient utilization of the four dimensional space-time. Given a cuboid container, a finite number of rigid cuboid items, and the time length that each item should be continuous baked in the container, the problem asks to arrange the starting time for each item being placed into the container and to arrange the position and orientation for each item at each instant during its continuous baking period such that the total time length the container be utilized is as short as possible. Here all side dimensions of the container and of the items are positive real numbers arbitrarily given. Differs from the classical packing problems, the position and orientation of each item in the container could be changed over time. Therefore, according to above mathematical model, the four-dimensional space-time can be utilized more truly and more fully. This paper then proves that there exists an exact algorithm that could solve the problem by finite operations, so we say this problem is weak computable. Based on the understanding of this computability proof, it is expected to design effective approximate algorithms in the near future. A piggyback work completed is a strict proof on the weak computability over general and natural case of the three-dimensional cuboid packing decision problem that all parameters are positive real numbers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。