密集时间域上基于时间线的规划的复杂性:探索中间地带
Complexity of Timeline-Based Planning over Dense Temporal Domains: Exploring the Middle Ground
摘要:
在本文中,我们解决的复杂性问题,基于时间线的规划密集的时间域。规划问题是通过一组独立的,但相互作用,组件,每个组件表示的一些状态变量,其行为随时间(时间轴)是由一组时间约束(同步规则)。虽然时间域通常被假设为离散的,但在这里我们考虑密集的情况。密集的时间线为基础的规划最近已被证明是不可判定的一般情况下,可判定性(NP-完全性)可以恢复限制到纯粹的存在同步规则(无规则)。在本文中,我们探讨了这两个极端之间的中间情况下未探索的领域。我们首先表明,可判定性和非原始递归硬度可以证明,通过承认同步规则与触发器,但迫使他们适当地检查约束,只有在未来的触发器(未来的简单规则)。通过在未来的简单规则中额外地约束区间的形式,可以获得更“易处理”的结果:通过避免奇异区间来保证EXPSPACE完备性,通过只允许[0,a]和[b,$\infty$ [..
英文摘要:
In this paper, we address complexity issues for timeline-based planning over dense temporal domains. The planning problem is modeled by means of a set of independent, but interacting, components, each one represented by a number of state variables, whose behavior over time (timelines) is governed by a set of temporal constraints (synchronization rules). While the temporal domain is usually assumed to be discrete, here we consider the dense case. Dense timeline-based planning has been recently shown to be undecidable in the general case; decidability (NP-completeness) can be recovered by restricting to purely existential synchronization rules (trigger-less rules). In this paper, we investigate the unexplored area of intermediate cases in between these two extremes. We first show that decidability and non-primitive recursive-hardness can be proved by admitting synchronization rules with a trigger, but forcing them to suitably check constraints only in the future with respect to the trigger (future simple rules). More "tractable" results can be obtained by additionally constraining the form of intervals in future simple rules: EXPSPACE-completeness is guaranteed by avoiding singular intervals, PSPACE-completeness by admitting only intervals of the forms [0,a] and [b,$\infty$[.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。