batsresearch/planetarium

Dataset and benchmark for assessing LLMs in translating natural language descriptions of planning problems into PDDL

planetarium's Issues

Question on Scene Graph

Hello,

I am trying to understand how you evaluate the problem equivalence. It seems that the isomorphism in scene graphs of two states is like checking if predicate description of two states can be unified (if the objects were considered as variables). For example state 1: (clear a) (clear b) (on-table a) (on-table b) (arm-empty)) and state 2: (clear d) (clear e) (on-table e) (on-table d) (arm-empty)) can be unified as follows a -> d, b -> e. So they are equivalent. Is my understanding correct?

Also, from the section 3.3 in the paper, it seems that the graph contains edges between proposition type and objects, but in Fig 4 has an edge from clear to arm-empty. I am confused as to what that edge indicates.

Regards,
Harsha Kokel