ICARUS: DAEDALUS ( Planning )

Description

• Uses variation of means-ends analysis
• Heuristic depth-first search through problem space
• Invokes LABYRINTH to retrieve an appropriate operator or stored plan based on:
  • Preconditions
  • Postconditions
  • Differences to be reduced
• Generates two subproblems:
  • One to change initial state into another that satisfies preconditions of the operator
  • One to change the state that results from applying the operator into one that satisfies the goal conditions
• Uses dervivational analogy when when a past problem plans are relavent
• Calls on LABARYNTH to save final plans
• Constantly checks memory for newly added tasks; interrupts planning for higher priority tasks