Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty

Simple Temporal Networks (STNs) are a well-studied model for representing and reasoning about time. An STN comprises a set of real-valued variables called time-points, together with a set of binary constraints, each of the form Y ≤ X + w. The problem of finding a feasible schedule (i.e., an assignment of real numbers to time-points such that all of the constraints are satisfied) is equivalent to the Single Source Shortest Path problem (SSSP) in the STN graph. Simple Temporal Networks with Uncertainty (STNUs) augment STNs to include contingent links that can be used, for example, to represent actions with uncertain durations. The duration of a contingent link is not controlled by the planner, but is instead controlled by a (possibly adversarial) environment. Each contingent link has the form, 〈A, `, u, C〉, where 0 < ` ≤ u <∞. Once the planner executes the activation time-point A, the environment must execute the contingent time-point C at some time A+ ∆, where ∆ ∈ [`, u]. Crucially, the planner does not know the value of ∆ in advance, but only discovers it when C executes. An STNU is dynamically controllable (DC) if there is a strategy that the planner can use to execute all of the non-contingent time-points, such that all of the constraints are guaranteed to be satisfied no matter which durations the environment chooses for the contingent links. The strategy can be dynamic in that it can react in real time to the contingent durations it observes. Recently, an upper bound of O(N3) was given for the DC-checking problem for STNUs, where N is the number of time-points. This paper introduces a new algorithm, called the RUL− algorithm, for solving the DCchecking problem for STNUs that improves on the O(N3) bound. The worst-case complexity of the RUL− algorithm is O(MN +K2N +KN logN), where N is the number of time-points, M is the number of constraints, and K is the number of contingent time-points. If M is O(N2), then the complexity reduces to O(N3); however, in sparse graphs the complexity can be much less. For example, if M is O(N logN), and K is O( √ N), then the complexity of the RUL− algorithm reduces to O(N2 logN). The RUL− algorithm begins by using the Bellman-Ford algorithm to compute a potential function. It then performs at most 2K rounds of computations, interleaving novel applications of Dijkstra’s algorithm to (1) generate new edges and (2) update the potential function in response to those new edges. The constraint-propagation/edge-generation rules used by the RUL− algorithm are distinguished from related work in two ways. First, they only generate unlabeled edges. Second, their applicability conditions are more restrictive. As a result, the RUL− algorithm requires only O(K) rounds of Dijkstra’s algorithm, instead of the O(N) rounds required by other approaches. The paper proves that the RUL− algorithm is sound and complete for the DC-checking problem for STNUs. 2012 ACM Subject Classification Networks → Network Algorithms 23:2 Faster DC Checking for STNUs