Message2251

Author mikko
Recipients mikko
Date 2012-06-05.14:18:24
Content
Attachments: problem1 and problem2 are logically equivalent. 
The only difference is that the goal is given as a ground atom
in problem1 and as a quantification in problem2. 
The causal graph heuristic gives different initial h values
for the two problems.

It seems like goals are hardcoded to be high(est)-level
in CausalGraph::calculate_topological_pseudo_sort 
(causal_graph.cc in preprocessor) when the causal graph is pruned.
This makes sense, but I think it should also be propagated 
to goal axiom's predecessors to be consistent over different
problem formulations.
This might influence other heuristics using the pruned CG as well.
Files
File name Uploaded
hr-domain.pddl mikko, 2012-06-05.14:18:24
History
Date User Action Args
2012-06-05 14:18:25mikkosetmessageid: <1338898705.25.0.917126733342.issue341@gmail.com>
2012-06-05 14:18:25mikkosetrecipients: + mikko
2012-06-05 14:18:25mikkolinkissue341 messages
2012-06-05 14:18:24mikkocreate