Incremental Lower Bounds for Additive Cost Planning Problems.
Patrik HaslumPublished in: ICAPS (2012)
Keyphrases
- planning problems
- lower bound
- optimal planning
- domain independent
- heuristic search
- state space
- ai planning
- upper bound
- planning domains
- deterministic domains
- planning systems
- partial observability
- htn planning
- probabilistic planning
- plan generation
- total cost
- fully observable
- solving planning problems
- optimal solution
- classical planning
- branch and bound
- concurrent actions
- domain independent planning
- objective function
- causal graph
- np hard
- min sum
- stochastic domains
- search space