Planning in ICARUS: DAEDALUS
DAEDALUS uses a variant of means-ends analysis to generate plans. This
component calls on LABYRINTH to retrieve appropriate operators or stored plan
based on the problem's preconditions, postconditions, or the differences it
reduces. If DAEDALUS detects a loop or a dead-end, it backtracks and
retrieves a different operator, producing a heuristic depth-first search
through the means-ends space. In the case that LABYRINTH returns a complete
plan, DAEDALUS carries out a form of
derivational
analogy, checking the
relevance to the problem at hand.
This algorithm of priority-first execution would seem to open the possibility
of starvation of lower-priority tasks. The description is not so clear about
this issue, so no assumptions can be made either way.
To return, press HOME
For the next component, press NEXT.