Using the Relaxed Plan Heuristic to Select Goals in Oversubscription Planning Problems.
Angel García OlayaTomás de la RosaDaniel BorrajoPublished in: CAEPIA (2011)
Keyphrases
- planning problems
- domain independent planning
- classical planning
- nondeterministic domains
- planning graph
- planning domains
- heuristic search
- planning in nondeterministic domains
- ai planning
- domain independent
- planning systems
- state space
- optimal planning
- plan generation
- optimal solution
- deterministic domains
- planning tasks
- heuristic functions
- solving planning problems
- planning process
- htn planning
- probabilistic planning
- state space search
- forward search
- fully observable
- automated planning
- concurrent actions
- domain specific
- dynamic programming
- search algorithm
- temporal planning
- partial observability
- optimal plans
- sensing actions
- heuristic function
- search space