Solving Sequential Planning Problems via Constraint Satisfaction.
Roman BartákDaniel ToropilaPublished in: Fundam. Informaticae (2010)
Keyphrases
- constraint satisfaction
- planning problems
- heuristic search
- solving planning problems
- constraint satisfaction problems
- constraint problems
- constrained problems
- state space
- search space
- constraint optimization
- ai planning
- search algorithm
- domain independent
- sat encodings
- constraint programming
- probabilistic planning
- constraint propagation
- search strategies
- constraint relaxation
- combinatorial problems
- robust fault detection
- phase transition
- sat solvers
- planning systems
- constraint solving
- partial observability
- htn planning
- classical planning
- planning domains
- arc consistency
- search problems
- finite domain
- temporal constraints
- markov decision problems
- constraint networks
- combinatorial optimization
- configuration problems
- np complete
- dynamic programming
- np hard