Optimal Delete-Free Planning Through Landmark-Based Pruning

Fri, 18 Apr 2025 10:29:15 GMT

This paper explores novel pruning methods to enhance the efficiency of optimal planning in delete-free domains. The authors observe that optimal plans can be constructed from sub-plans focused on individual landmarks. They introduce complementary pruning techniques leveraging And/Or graphs to represent the planning problem. Empirical evaluations demonstrate that these methods significantly improve the performance of state-of-the-art heuristic search algorithms on delete-free problem benchmarks.

Nir's NotebookLM Podcasts

Optimal Delete-Free Planning Through Landmark-Based Pruning