Re: Temporal TL Plan's advance time heuristic

[Subbarao Kambhampati <rao@parichaalak.eas.asu.edu>]

Regarding Romeo's remark that Temporal TL plan always adds all
applicable actions before advancing the clock--
 
I took a look at the paper--they do clearly show in the algorithm that 
there is a non-deterministic choice as to whether to add an action or
advance clock. So, they are complete in theory.

All they say is that if you want maximal concurrency then you should
use the heuristic of preferring action application to advance time
operation. (Of course, this is just a heuristic... if the additioanl
actions that you applied are "poison pill actions" as discussed int he 
class, then the planner will eventually backtrack and consider
advancing time instead of action application.

Rao
[Apr  5, 2003]