Explain the baseline planner’s translation bottleneck

Determine whether the baseline planner’s failure to complete the translation on the larger elevator planning instances is caused by the extensive bookkeeping machinery introduced to generate the compiled domain and problem.

Background

The paper evaluates its compilation approach for Pure-Past Linear Temporal Logic goals against existing temporal-goal compilation tools and planners. In the elevator experiments, the authors report that one baseline planner becomes stuck during the translation step when the temporal-goal formula grows. They explicitly conjecture that the cause is the substantial bookkeeping machinery used to construct the compiled planning task, but do not establish this explanation.

References

In fact, the planner gets stuck in the translation step, and we conjecture it is due to the high bookkeeping machinery introduced to produce the compiled domain and problem.

— Planning for Temporally Extended Goals in Pure-Past Linear Temporal Logic: A Polynomial Reduction to Standard Planning  (2204.09960 - Giacomo et al., 2022) in Section 5, Experiments, paragraph on the deterministic elevator benchmark