[论文解读] Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks -- Extended version with an Improved Upper Bound --

Massimo Cairo, Carlo Comin+1 more|arXiv (Cornell University)|Aug 14, 2016

Constraint Satisfaction and Optimization参考文献 15被引用 4

一句话总结

本文提出了 $π$-DC，即在具有瞬时响应时间的条件简单时序网络（CSTNs）中动态一致性的形式化概念，其中规划者对观测结果立即作出响应。该文首次提出了一种完整且正确的 $π$-DC-Checking 算法，通过归约为标准的 DC-Checking 实现，时间复杂度为（伪）单指数时间，并通过进一步归约为 $1$-DC 获得了 $|Σ_P|\cdot|V|$ 倍的效率提升。

ABSTRACT

CSTNs is a constraint-based graph-formalism for conditional temporal planning. In order to address the DC-Checking problem, in [Comin and Rizzi, TIME 2015] we introduced epsilon-DC (a refined, more realistic, notion of DC), and provided an algorithmic solution to it. The epsilon-DC notion is interesting per se, and the epsilon-DC-Checking algorithm in [Comin and Rizzi, TIME 2015] rests on the assumption that the reaction-time satisfies epsilon > 0; leaving unsolved the question of what happens when epsilon = 0. In this work, we introduce and study pi-DC, a sound notion of DC with an instantaneous reaction-time (i.e. one in which the planner can react to any observation at the same instant of time in which the observation is made). Firstly, we demonstrate by a counter-example that pi-DC is not equivalent to 0-DC, and that 0-DC is actually inadequate for modeling DC with an instantaneous reaction-time. This shows that the main results obtained in our previous work do not apply directly, as they were formulated, to the case of epsilon=0. Motivated by this observation, as a second contribution, our previous tools are extended in order to handle pi-DC, and the notion of ps-tree is introduced, also pointing out a relationship between pi-DC and HyTN-Consistency. Thirdly, a simple reduction from pi-DC-Checking to DC-Checking is identified. This allows us to design and to analyze the first sound-and-complete pi-DC-Checking procedure. Remarkably, the time complexity of the proposed algorithm remains (pseudo) singly-exponential in the number of propositional letters. Finally, it is observed that the technique can be leveraged to actually reduce from pi-DC to 1-DC, this allows us to further improve the exponents in the time complexity of pi-DC-Checking.

研究动机与目标

• 为具有瞬时响应时间的条件简单时序网络（CSTNs）形式化一个有意义的动态一致性概念。
• 弥补先前研究的不足，即假设 $ε > 0$，通过分析 $ε = 0$ 的情况，证明其不足以建模瞬时响应。
• 设计一个完整且正确的算法用于检查 $π$-DC，确保在瞬时响应约束下的正确性。
• 通过将 $π$-DC-Checking 归约为 $1$-DC-Checking，提升时间复杂度，实现 $|Σ_P|\cdot|V|$ 倍的改进。

提出的方法

• 引入 $π$-DC 作为一种新的、合理的动态一致性概念，允许对观测结果立即响应。
• 构造一个反例，证明 $π$-DC 与 $0$-DC 不等价，从而证明 $0$-DC 无法充分建模瞬时响应。
• 定义 ps-tree 概念，以支持 $π$-DC 的分析，并将其与超时序网络（HyTNs）中的一致性联系起来。
• 提出从 $π$-DC 到标准 DC-Checking 的归约方法，使现有 DC-Checking 算法可复用。
• 引入缩放技术：将 CSTN 中的所有权重乘以因子 $ξ = |Σ_P|\cdot|V|^2 + 1$，以实现向 $1$-DC-Checking 的归约。
• 计算一个偏移参数 $\eta \in [0,1)$，以避免执行时间冲突，确保 $π$-ES 能够正确重建。

实验结果

研究问题

• RQ1 $0$-DC 是否等价于 CSTNs 中具有瞬时响应时间的动态一致性概念？
• RQ2 能否设计一个完整且正确的算法用于 $π$-DC-Checking，使得响应在观测发生后立即触发？
• RQ3 从 $π$-DC 到 $1$-DC-Checking 的归约是否保持正确性并提升时间复杂度？
• RQ4 $π$-DC-Checking 的时间复杂度是否可被限制在命题字母数量的（伪）单指数时间范围内？
• RQ5 计算偏移参数 $\eta$ 的计算成本是多少，以确保执行时间重建的有效性？

主要发现

• 本文证明 $π$-DC 与 $0$-DC 不等价，且 $0$-DC 因结构限制而无法建模瞬时响应时间。
• 开发了一种完整且正确的 $π$-DC-Checking 算法，基于向标准 DC-Checking 的归约。
• 该算法的时间复杂度在命题字母数量 $|P|$ 上保持（伪）单指数时间，与先前结果一致。
• 通过将 $π$-DC 归约为 $1$-DC-Checking，该算法在时间复杂度上相比原始 $π$-DC-Checking 方法获得了 $|Σ_P|\cdot|V|$ 倍的提升。
• 偏移参数 $\eta$ 可在 $O(|Σ_P|\cdot|V|^2)$ 时间内计算，从而实现有效且高效的执行策略重建。
• 所提出的方法确保所有执行时间被正确偏移并保持顺序，从而在瞬时响应约束下保持动态一致性。