Efficient Implementation of the Plan Graph in STAN

Details Efficient Implementation of the Plan Graph in STAN Efficient Implementation of the Plan Graph in STAN

2011-05-27

arxiv.org/abs/1105.5457v1

Journal Of Artificial Intelligence Research, Volume 10, pages 87-115, 1999

Computer Science

Artificial Intelligence

Scientific paper

10.1613/jair.570

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.

Affiliated with

Also associated with

No associations

Rating

Efficient Implementation of the Plan Graph in STAN does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Implementation of the Plan Graph in STAN, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Implementation of the Plan Graph in STAN will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-664468