Relaxed BDDs: An Admissible Heuristic for Delete-Free Planning Based on a Discrete Relaxation.
Margarita P. CastroChiara PiacentiniAndré A. CiréJ. Christopher BeckPublished in: ICAPS (2019)
Keyphrases
- heuristic search
- admissible heuristics
- optimal planning
- planning problems
- search algorithm
- search space
- pattern databases
- heuristic function
- domain independent planning
- state space
- constraint satisfaction
- search problems
- evaluation function
- search strategies
- path finding
- classical planning
- heuristic search algorithms
- objective function
- finite number
- binary decision diagrams