---
title: "Using Available Memory to Transform Graphplan's Search"
authors:
  - "Terry Zimmerman"
  - "Subbarao Kambhampati"
doi: ""
url: "https://ijcai.org/proceedings/2003/261"
pdf: "https://ijcai.org/proceedings/2003/0261.pdf"
venue: "Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence"
year: 2003
pages: "1526--1"
track: ""
keywords:
---

# Using Available Memory to Transform Graphplan's Search

Terry Zimmerman, Subbarao Kambhampati

*Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence*, pages 1526--1.

## Abstract

We present a major variant of the Graphplan algorithm that employs available memory to transform the depth-first nature of Graphplan's search into an iterative sta te space view in which heuristics can be used to traverse the search space. When the planner, PEGG, is set to conduct exhaustive search, it produces guaranteed optimal parallel plans 2 to 90 times faster than a version of Graphplan enhanced with CSP speedup methods. By heuristically pruning this search space PEGG produces plans comparable to Graphplan's in makespan, at speeds ap proaching state-of-the-art heuristic serial planners.