Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Efficient Implementation of the Plan Graph in STAN

Long, D. and Fox, M. (1999) Efficient Implementation of the Plan Graph in STAN. Journal of Artificial Intelligence Research, 10. pp. 87-115. ISSN 11076-9757

[img]
Preview
PDF (strathprints001849.pdf)
Download (412Kb) | Preview

    Abstract

    STAN is a Graphplan-based planner, so-called because it uses a variety of STate ANalysis techniques to enhance its performance. STAN competed in the AIPS-98 planning competition where it compared well with the other competitors in terms of speed, finding solutions fastest to many of the problems posed. Although the domain analysis techniques STAN exploits are an important factor in its overall performance, we believe that the speed at which STAN solved the competition problems is largely due to the implementation of its plan graph. The implementation is based on two insights: that many of the graph construction operations can be implemented as bit-level logical operations on bit vectors, and that the graph should not be explicitly constructed beyond the fix point. This paper describes the implementation of STAN's plan graph and provides experimental results which demonstrate the circumstances under which advantages can be obtained from using this implementation.

    Item type: Article
    ID code: 1849
    Keywords: Electronic computers. Computer science
    Subjects: Science > Mathematics > Electronic computers. Computer science
    Department: Faculty of Science > Computer and Information Sciences
    Related URLs:
      Depositing user: Strathprints Administrator
      Date Deposited: 05 Oct 2006
      Last modified: 14 Mar 2012 19:42
      URI: http://strathprints.strath.ac.uk/id/eprint/1849

      Actions (login required)

      View Item

      Fulltext Downloads: