简单析取时态问题的模型与算法
Models and algorithms for simple disjunctive temporal problems
摘要：
简单的时间问题代表了一类强大的模型，能够描述在许多现实世界的应用，如物流，机器人规划和管理系统中出现的事件之间的时间关系。经典的简单时态问题允许每个事件只有一个发布和到期日。在本文中，我们专注于事件的情况下，可能有一个任意大的数量的释放和到期日。然而，这种类型的问题有各种各样的名称。为了简化和标准化术语，我们引入了简单析取时态问题。我们提供了三个数学模型来描述这个问题，使用约束规划和线性规划。为了有效地解决简单的析取时态问题，我们设计了两个新的算法的灵感来自以前的研究，这两个利用问题的结构，以显着降低其空间复杂度。此外，我们从文献中实现算法，并提供了第一个深入的实证研究比较方法，以解决简单的析取时间问题，在广泛的实验。我们的分析和结论为未来的研究人员和从业者在新的应用程序中解决类似的时间约束问题提供了指导。所有结果、源代码和实例都是公开的，以进一步帮助未来的研究。
英文摘要：
Simple temporal problems represent a powerful class of models capable of describing the temporal relations between events that arise in many real-world applications such as logistics, robot planning and management systems. The classic simple temporal problem permits each event to have only a single release and due date. In this paper, we focus on the case where events may have an arbitrarily large number of release and due dates. This type of problem, however, has been referred to by various names. In order to simplify and standardize nomenclatures, we introduce the name Simple Disjunctive Temporal Problem. We provide three mathematical models to describe this problem using constraint programming and linear programming. To efficiently solve simple disjunctive temporal problems, we design two new algorithms inspired by previous research, both of which exploit the problem's structure to significantly reduce their space complexity. Additionally, we implement algorithms from the literature and provide the first in-depth empirical study comparing methods to solve simple disjunctive temporal problems across a wide range of experiments. Our analysis and conclusions offer guidance for future researchers and practitioners when tackling similar temporal constraint problems in new applications. All results, source code and instances are made publicly available to further assist future research.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
