Solving Classical AI Planning Problems Using Planning-Independent CP Modeling and Search.
Behrouz BabakiGilles PesantClaude-Guy QuimperPublished in: SOCS (2020)
Keyphrases
- planning problems
- solving planning problems
- planning systems
- classical planning
- ai planning
- planning graph
- heuristic search
- planning in nondeterministic domains
- domain independent planning
- domain independent
- planning domains
- state space
- search problems
- search algorithm
- automated planning
- conformant planning
- plan generation
- probabilistic planning
- search space
- partial observability
- forward search
- planning tasks
- admissible heuristics
- causal graph
- htn planning
- deterministic domains
- constraint programming
- concurrent actions
- temporal planning
- stochastic domains
- macro operators
- optimal planning
- search strategies
- fully observable
- belief space
- planning process
- integer programming
- objective function
- constraint satisfaction
- hierarchical task network
- sensing actions
- search strategy
- state space search
- partially observable markov decision processes
- heuristic function
- heuristic search algorithms
- markov decision problems
- planning under uncertainty
- reinforcement learning