Page Contributors: Adam Green,
Planner Quality: -
Year Published: 2004
Preceded By: -
CPT is a family of temporal planners, consisting of CPT, CPT2, CPT3 and CPT4. CPT is a Constraint Programming based approach to the Optimal Temporal problem in planning. This planner relies of Partial Order Causal Link (POCL) based branching in the search space, and uses Constraint Programming (CP) to perform pruning and reduce the search space (see sections on CP and POCL [In Progress]).
CPT has not been tested with eviscerator yet. CPT is designed for temporal domains and so most likely does not support numeric planning, it probably supports classical (non-temporal numeric) planning, but is probably less efficient in these domains.
IPC 2008 notes the following about CPT3:
We encountered problems when compiling the planner on 64-bit machines. Specifically, compilation succeeded, but the planner failed on solvable instances (e.g. Peg Solitaire #1). Hence, we recommend compiling the planner on 32-bit machines, which worked for us. (Running the 32-bit planner on a 64-bit machine did not cause problems.)