Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming.
Vincent VidalHector GeffnerPublished in: AAAI (2004)
Keyphrases
- constraint programming
- constraint satisfaction problems
- combinatorial problems
- constraint propagation
- constraint satisfaction
- integer programming
- temporal planning
- search heuristics
- global constraints
- column generation
- search strategies
- temporal constraints
- branch and bound
- temporal information
- optimal solution
- constraint solving
- constraint solver
- finite domain
- symmetry breaking
- hard and soft constraints
- heuristic search
- search space
- itemset mining
- dynamic programming
- ai planning
- temporal reasoning
- domain independent
- arc consistency