A Structural Characterization of Temporal Dynamic Controllability

An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is Dynamically Controllable, i.e., whether the temporal requirements are feasible in the light of uncertain durations of some processes. Previous work has presented an O(N5 ) algorithm for testing this property. Here, we introduce a new analysis of temporal cycles that leads to an O(N4 ) algorithm.

• Type: Conference
• Year: 2006
• Where: CP
• Authors: Paul Morris
• Keywords: Artificial Intelligence, CP 2006, Temporal Network, Temporal Planners, Temporal Uncertainty