Planning with Pattern Databases

Planning with Pattern Databases,Stefan Edelkamp

Planning with Pattern Databases   (Citations: 89)
BibTex | RIS | RefWorks Download
Heuristic search planning effectively finds solutions for large planning problems, but since the estimates are either not admissible or too weak, optimal solutions are found in rare cases only. In contrast, heuristic pattern databases are known to significantly improve lower bound estimates for optimally solving challenging single-agent problems like the 24-Puzzle or Rubik's Cube.
Cumulative Annual
Sort by: