Exploiting symmetry in the planning graph via explanation-guided search

Terry Zimmerman, Subbarao Kambhampati

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

10 Scopus citations

Abstract

We present a method for exploiting the symmetry in the planning graph structure and certain redundancies inherent in the Graphplan algorithm, so as to improve its backward search. The main insight underlying our method is that due to these features the backward search conducted at level k + 1 of the graph is essentially a replay of the search conducted at the previous level k with certain well-defined extensions. Our method consists of maintaining a pilot explanation structure capturing the failures encountered at previous levels of the search, and using it in an intelligent way to guide the search at the newer levels. The standard EBL and DDB techniques can be employed to control the size of the pilot explanation. The technique has been implemented in the EGBG system, and we present a preliminary empirical study.

Original languageEnglish (US)
Title of host publicationProceedings of the National Conference on Artificial Intelligence
PublisherAAAI
Pages605-611
Number of pages7
ISBN (Print)0262511061
StatePublished - Jan 1 1999
EventProceedings of the 1999 16th National Conference on Artificial Intelligence (AAAI-99), 11th Innovative Applications of Artificial Intelligence Conference (IAAI-99) - Orlando, FL, USA
Duration: Jul 18 1999Jul 22 1999

Publication series

NameProceedings of the National Conference on Artificial Intelligence

Other

OtherProceedings of the 1999 16th National Conference on Artificial Intelligence (AAAI-99), 11th Innovative Applications of Artificial Intelligence Conference (IAAI-99)
CityOrlando, FL, USA
Period7/18/997/22/99

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Exploiting symmetry in the planning graph via explanation-guided search'. Together they form a unique fingerprint.

Cite this