[Paper Review] 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 Optimization15 references4 citations

TL;DR

This paper introduces $π$-DC, a formal notion of dynamic consistency in Conditional Simple Temporal Networks (CSTNs) with instantaneous reaction-time, where planners respond to observations immediately. It presents the first sound-and-complete algorithm for $π$-DC-Checking via a reduction to standard DC-Checking, achieving (pseudo) singly-exponential time complexity, and further improves efficiency by reducing to $1$-DC with a $|Σ_P|\cdot|V|$ factor gain.

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.

Motivation & Objective

• To formalize a meaningful notion of dynamic consistency with instantaneous reaction-time in Conditional Simple Temporal Networks (CSTNs).
• To address the gap in prior work, which assumed $ε > 0$, by analyzing the case $ε = 0$ and showing it is insufficient for modeling instantaneous response.
• To develop a sound-and-complete algorithm for checking $π$-DC, ensuring correctness under instantaneous reaction constraints.
• To improve time complexity by reducing $π$-DC-Checking to $1$-DC-Checking, achieving a $|Σ_P|\cdot|V|$ factor improvement.

Proposed method

• Introduce $π$-DC as a new, sound notion of dynamic consistency allowing immediate reaction to observations.
• Construct a counter-example to show that $π$-DC is not equivalent to $0$-DC, proving $0$-DC is inadequate for instantaneous response.
• Define the notion of a ps-tree to support the analysis of $π$-DC and relate it to consistency in Hyper Temporal Networks (HyTNs).
• Propose a reduction from $π$-DC to standard DC-Checking, enabling the reuse of existing DC-Checking algorithms.
• Introduce a scaling technique: scale all weights in the CSTN by a factor $ξ = |Σ_P|\cdot|V|^2 + 1$ to enable reduction to $1$-DC-Checking.
• Compute a shift parameter $\eta \in [0,1)$ to avoid conflicts in execution times, ensuring correct reconstruction of $π$-ES from the scaled solution.

Experimental results

Research questions

• RQ1 Is $0$-DC equivalent to a notion of dynamic consistency with instantaneous reaction-time in CSTNs?
• RQ2 Can a sound and complete algorithm be designed for $π$-DC-Checking, where reactions occur instantaneously upon observation?
• RQ3 Does the reduction from $π$-DC to $1$-DC-Checking preserve correctness and improve time complexity?
• RQ4 Can the time complexity of $π$-DC-Checking be bounded within (pseudo) singly-exponential time in the number of propositional letters?
• RQ5 What is the computational cost of computing the shift parameter $\eta$ to ensure valid execution time reconstruction?

Key findings

• The paper establishes that $π$-DC is not equivalent to $0$-DC, and $0$-DC fails to model instantaneous reaction-time due to structural limitations.
• A sound-and-complete algorithm for $π$-DC-Checking is developed, based on a reduction to standard DC-Checking.
• The time complexity of the algorithm remains (pseudo) singly-exponential in the number of propositional letters $|P|$, matching prior results.
• By reducing $π$-DC to $1$-DC-Checking, the algorithm achieves a $|Σ_P|\cdot|V|$ factor improvement in time complexity over the original $π$-DC-Checking approach.
• The shift parameter $\eta$ can be computed in $O(|Σ_P|\cdot|V|^2)$ time, enabling efficient reconstruction of valid execution strategies.
• The proposed method ensures that all execution times are correctly shifted and ordered, preserving dynamic consistency under instantaneous response constraints.