A timeless predicate is a predicate that is always true and cannot be changed by any action.
PDDL Wiki
This would help with reducing generated code. For domains with grid-like structures that specify adjacency connections, the number of potential predicates is huge, but the predicates that define the edges are usually constant.
A timeless predicate is a predicate that is always true and cannot be changed by any action.
PDDL Wiki
This would help with reducing generated code. For domains with grid-like structures that specify adjacency connections, the number of potential predicates is huge, but the predicates that define the edges are usually constant.