Abstract
I highlight some inefficiencies of Graphplan's backward search algorithm, and describe how these can be eliminated by adding explanation-based learning and dependency-directed backtracking capabilities to Graphplan. I will then demonstrate the effectiveness of these augmentations by describing results of empirical studies that show dramatic improvements in run-time (w IOOx speedups) as well as solvability-horizons on benchmark problems across seven different domains.
| Original language | English (US) |
|---|---|
| Title of host publication | IJCAI International Joint Conference on Artificial Intelligence |
| Pages | 982-987 |
| Number of pages | 6 |
| Volume | 2 |
| State | Published - 1999 |
| Event | 16th International Joint Conference on Artificial Intelligence, IJCAI 1999 - Stockholm, Sweden Duration: Jul 31 1999 → Aug 6 1999 |
Other
| Other | 16th International Joint Conference on Artificial Intelligence, IJCAI 1999 |
|---|---|
| Country/Territory | Sweden |
| City | Stockholm |
| Period | 7/31/99 → 8/6/99 |
ASJC Scopus subject areas
- Artificial Intelligence