SHOP3

SHOP3 Plan Generation

Here’s a rough break-down of Shop 3’s representation for HTN Data Structures and its representational power.

Please feel free to write to tomcat@lingprefix.info for more info.
<hr=””> </hr=””>

<hr=””>Functions</hr=””>


find-plans: Returns solution-set for planning problem
Arguments:

  • domain: Problem Domain from which solutions are to be generated
  • which: Specifies Depth-First, Iterative-deeping, or Randomized Search Algorithm
  • verbose: Descriptive Level of Operation and Operator-cost Statistics
  • plan-trees: Includes list of Plan-trees
  • final-states: Include Final-state Structure

Globals: Special variables with dynamic extent (dynamic binding)

  • start-run-time
  • start-real-time
  • which
  • internal-time-tag
  • state-encoding
  • leashed
  • state-encoding
  • collect-state
  • optimize-cost
  • optimal-cost
  • expansions
  • depth-cutoff
  • plans-found
  • optimal-plan
  • explanation
  • external-access
  • trace-query
  • unifiers-found
  • states-found
  • hand-steet
  • leashed
  • domain

find-plans-1: Returns solution-set for planning problem


find-plans1
seek-plans

Globals

  • Collect-state
  • Plan-tree
  • Plans-found
  • Expansion

Variable

  • plans-found
  • unifiers-found
  • extract-tree
  • Domain
  • State
  • Tasks
  • Search Algorithm
  • Problem
  • Output
  • Stats:
  • Stats-header:
  • Cost –
  • Real-Time
  • Run-Time
  • Total

* Coverage of Domain Description Language