Re: Question on planning

[Subbarao Kambhampati <rao@asu.edu>]

Okay... You are right... ;-)

For the planning graphs that we constructed (which do not take negative 
interactions into account),
the level heuristic and the Max heuristic are the same.

(But, come tuesday, we will talk about how we can take negative 
interactions into account in constructing planning graphs--once we do that 
the level and max heuristics in that graph will be different. Specifically, 
despite the fact that both On(A,B) and On(B,A) are  present by the
second level, there will never be a level wehre both are present together 
without being mutually exclusive--making level heurstic have value 
infinity, and max heuristic have value 2)

Rao


At 08:10 PM 10/18/2001 -0700, you wrote:
>On Tuesday you said that in looking at planning graphs, two heuristics are to
>look at the first level when all literals are present, and to take the maximum
>of the level numbers when each literal appears.  My question is... since
>literals are carried through each level, aren't these the same?  How is the
>level heuristic "bigger" than the max heuristic?
>
>Brian