On the importance of breaking ties in the relaxed plan heuristic.
Tomás de la RosaRaquel FuentetajaPublished in: J. Exp. Theor. Artif. Intell. (2011)
Keyphrases
- optimal solution
- domain independent planning
- plan recognition
- search algorithm
- dynamic programming
- packing problem
- classical planning
- lower bound
- heuristic solution
- partial solutions
- tabu search
- heuristic search
- search procedure
- plan generation
- bin packing
- enforced hill climbing
- partial order planner
- neural network
- exact algorithms
- simulated annealing
- search space
- bayesian networks
- case study
- genetic algorithm