Under-Approximation Refinement for Classical Planning

Heusner, Manuel and Wehrle, Martin and Pommerening, Florian and Helmert, Malte. (2014) Under-Approximation Refinement for Classical Planning. In: Proceedings of ICAPS 2014, the 24th International Conference on Automated Planning and Scheduling. Palo Alto, Calif., pp. 365-369.

PDF - Published Version

Official URL: http://edoc.unibas.ch/dok/A6328939

Downloads: Statistics Overview


A general and important problem of search-based planning techniques is the state explosion problem, which is usually tackled with approaches to reduce the branching factor of the planning task. Such approaches often implicitly exploit the observation that the number of available operators is higher than the number of operators that are actually needed to find a plan. In this paper, we propose a simple, but general under-approximation refinement framework for satisficing planning that explicitly exploits this observation. Our approach iteratively searches for plans with operator subsets, which are refined if necessary by adding operators that appear to be needed. Our evaluation shows that even a straight-forward instantiation of this framework yields a competitive planner that often finds plans with small operator sets.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Heusner, Manuel and Wehrle, Martin and Pommerening, Florian and Helmert, Malte
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
edoc DOI:
Last Modified:30 Apr 2021 03:10
Deposited On:05 Jun 2015 08:52

Repository Staff Only: item control page