Dealing with Uncertain Durations In Temporal Constraint Networks dedicated to Planning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Dynamic Control Of Plans With Temporal Uncertainty (2001, background): “A projection [Vidal and Ghallab, 1996] of Γ is a Simple Temporal Network derived from Γ where each requirement link is replaced by an identical STN link, and each contingent link e is replaced by an STN link with equal upper and lower bounds [b, b] for some b such that l(e) ≤ b ≤ u(e).”
Handling contingency in temporal constraint networks: from consistency to controllabilities (1999, methodology): “The algorithm StrongControllability(STPU) (Vidal and Ghallab, 1996) is hence straightforward and consists only in (1) a linear time translation of the original constraints into constraints between mere activated time-points, and (2) the application of a classical polynomial-time propagation algorith”
Automated Planning and Acting (2016, methodology): “About the Authors Malik Ghallab is Directeur de Recherche at CNRS, the National Center for Scientific Research, France.”