Results 1 
3 of
3
P 3 C: A New Algorithm for the Simple Temporal Problem
"... The Simple Temporal Problem (STP) is a subproblem of almost any planning or scheduling problem involving time constraints. An existing efficient method to solve the STP, called △STP, is based on partial path consistency and starts from a chordal constraint graph. In this paper, we analyse this algo ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
The Simple Temporal Problem (STP) is a subproblem of almost any planning or scheduling problem involving time constraints. An existing efficient method to solve the STP, called △STP, is based on partial path consistency and starts from a chordal constraint graph. In this paper, we analyse this algorithm and show that there exist instances for which its time complexity is quadratic in the number of triangles in the constraint graph. We propose a new algorithm, P 3 C, whose worstcase time complexity is linear in the number of triangles. We show both formally and experimentally that P 3 C outperforms △STP significantly.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008) P 3 C: A New Algorithm for the Simple Temporal Problem
"... Temporal problem Temporal domain The Simple Temporal Problem (STP) is a subproblem of almost any planning or scheduling problem involving time constraints. An existing efficient method to solve the STP, called △STP, is based on partial path consistency and starts from a chordal constraint graph. In ..."
Abstract
 Add to MetaCart
Temporal problem Temporal domain The Simple Temporal Problem (STP) is a subproblem of almost any planning or scheduling problem involving time constraints. An existing efficient method to solve the STP, called △STP, is based on partial path consistency and starts from a chordal constraint graph. In this paper, we analyse this algorithm and show that there exist instances for which its time complexity is quadratic in the number of triangles in the constraint graph. We propose a new algorithm, P 3 C, whose worstcase time complexity is linear in the number of triangles. We show both formally and experimentally that P 3 C outperforms △STP significantly.