Using available memory to transform Graphplan's search

Terry Zimmerman, Subbarao Kambhampati

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 state 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 Graph-plan enhanced with CSP speedup methods. By heuristically pruning this search space PEGG produces plans comparable to Graphplan's in make-span, at speeds approaching state-of-the-art heuristic serial planners.

Original languageEnglish (US)
Title of host publicationIJCAI International Joint Conference on Artificial Intelligence
Pages1526-1527
Number of pages2
StatePublished - 2003
Event18th International Joint Conference on Artificial Intelligence, IJCAI 2003 - Acapulco, Mexico
Duration: Aug 9 2003Aug 15 2003

Other

Other18th International Joint Conference on Artificial Intelligence, IJCAI 2003
CountryMexico
CityAcapulco
Period8/9/038/15/03

Fingerprint

Data storage equipment

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Zimmerman, T., & Kambhampati, S. (2003). Using available memory to transform Graphplan's search. In IJCAI International Joint Conference on Artificial Intelligence (pp. 1526-1527)

Using available memory to transform Graphplan's search. / Zimmerman, Terry; Kambhampati, Subbarao.

IJCAI International Joint Conference on Artificial Intelligence. 2003. p. 1526-1527.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zimmerman, T & Kambhampati, S 2003, Using available memory to transform Graphplan's search. in IJCAI International Joint Conference on Artificial Intelligence. pp. 1526-1527, 18th International Joint Conference on Artificial Intelligence, IJCAI 2003, Acapulco, Mexico, 8/9/03.
Zimmerman T, Kambhampati S. Using available memory to transform Graphplan's search. In IJCAI International Joint Conference on Artificial Intelligence. 2003. p. 1526-1527
Zimmerman, Terry ; Kambhampati, Subbarao. / Using available memory to transform Graphplan's search. IJCAI International Joint Conference on Artificial Intelligence. 2003. pp. 1526-1527
@inproceedings{0d3fee3784314f61bf03e87fb8bea5a4,
title = "Using available memory to transform Graphplan's search",
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 state 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 Graph-plan enhanced with CSP speedup methods. By heuristically pruning this search space PEGG produces plans comparable to Graphplan's in make-span, at speeds approaching state-of-the-art heuristic serial planners.",
author = "Terry Zimmerman and Subbarao Kambhampati",
year = "2003",
language = "English (US)",
pages = "1526--1527",
booktitle = "IJCAI International Joint Conference on Artificial Intelligence",

}

TY - GEN

T1 - Using available memory to transform Graphplan's search

AU - Zimmerman, Terry

AU - Kambhampati, Subbarao

PY - 2003

Y1 - 2003

N2 - 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 state 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 Graph-plan enhanced with CSP speedup methods. By heuristically pruning this search space PEGG produces plans comparable to Graphplan's in make-span, at speeds approaching state-of-the-art heuristic serial planners.

AB - 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 state 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 Graph-plan enhanced with CSP speedup methods. By heuristically pruning this search space PEGG produces plans comparable to Graphplan's in make-span, at speeds approaching state-of-the-art heuristic serial planners.

UR - http://www.scopus.com/inward/record.url?scp=84880785413&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880785413&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84880785413

SP - 1526

EP - 1527

BT - IJCAI International Joint Conference on Artificial Intelligence

ER -