基于时间线的规划:表达性和复杂性
Timeline-based planning: Expressiveness and Complexity
摘要:
基于时间线的规划是最初在空间飞行任务规划和时间安排方面开发的一种方法,其中问题域被建模为由若干独立但相互作用的组成部分组成的系统,这些组成部分随着时间的推移的行为,即时间线,受到一组时间限制的制约。这种方法不同于常见的PDDL类规划语言的基于操作的观点。基于时间线的系统已成功地部署在一些空间飞行任务和其他领域。然而,尽管取得了实际的成功,对范式的彻底的理论理解仍然缺失。本文填补了这一空白,提供了第一个详细的正式和计算性能的时间线为基础的方法来规划。特别是,我们表明,一个特别受限制的形式主义的变体已经足够的表达,以紧凑地捕捉基于行动的时间规划问题。然后,找到一个解决方案的时间线为基础的规划问题的计划被证明是EXPSPACE完全的。然后,我们研究了基于时间线的规划问题的不确定性,其中包括外部组件的行为是不受控制的计划系统。我们确定了一些问题,在国家的最先进的方法的基础上灵活的计划,提出基于时间线的游戏,更一般的博弈论制定的问题,解决这些问题。我们发现,这种游戏的获胜策略可以在双指数时间。然后,我们从逻辑的角度研究了形式主义的表达性,表明(大多数)基于时间线的规划问题可以捕获有界TPTL与过去,一个片段的TPTL+P,不像后者,保持一个EXPSPACE可满足性问题。引入了逻辑,并通过扩展最近的一次通过树形表方法LTL解决其可满足性问题。
英文摘要:
Timeline-based planning is an approach originally developed in the context of space mission planning and scheduling, where problem domains are modelled as systems made of a number of independent but interacting components, whose behaviour over time, the timelines, is governed by a set of temporal constraints. This approach is different from the action-based perspective of common PDDL-like planning languages. Timeline-based systems have been successfully deployed in a number of space missions and other domains. However, despite this practical success, a thorough theoretical understanding of the paradigm was missing. This thesis fills this gap, providing the first detailed account of formal and computational properties of the timeline-based approach to planning. In particular, we show that a particularly restricted variant of the formalism is already expressive enough to compactly capture action-based temporal planning problems. Then, finding a solution plan for a timeline-based planning problem is proved to be EXPSPACE-complete. Then, we study the problem of timeline-based planning with uncertainty, that include external components whose behaviour is not under the control of the planned system. We identify a few issues in the state-of-the-art approach based on flexible plans, proposing timeline-based games, a more general game-theoretic formulation of the problem, that addresses those issues. We show that winning strategies for such games can be found in doubly-exponential time. Then, we study the expressiveness of the formalism from a logic point of view, showing that (most of) timeline-based planning problems can be captured by Bounded TPTL with Past, a fragment of TPTL+P that, unlike the latter, keeps an EXPSPACE satisfiability problem. The logic is introduced and its satisfiabilty problem is solved by extending a recent one-pass tree-shaped tableau method for LTL.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。