Exploring the effectivity of AND/OR landmark extraction on modern planning domains

This paper explores the application of landmark-based planning algorithms, specifically focusing on AND/OR landmark extraction methods. Drawing from classical planning principles and recent advancements, we investigate the effectiveness of landmark extraction in guiding the search for solutions to planning problems. Our research questions center...

Extending SymbolicPlanners with forward propagation landmark extraction

The Fast Downward planning system is currently mainly used for solving classical problems. Another alternative to Fast Downward is SymbolicPlanners, which sacrifices speed for generality and extensibility. SymbolicPlanners is missing landmark based planners and landmark extraction algorithms. The research question we are trying to answer in this...

Optimizing the PDDL domain of TUSP to improve planner performance: Modifying the domain to improve planner execution time, plan quality, and problem solvability

It is possible to improve the performance of planners by modifying the PDDL domain of a problem. The goal of this research is to implement this to the domain of the Train Unit Shunting Problem (TUSP). The research question we attempt to answer is: To what extent can we improve planner performance by optimizing the PDDL domain of TUSP? The main...