Optimizing the Optimization of Planning Domains by Automatic Action Schema Splitting

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Most planners are based on grounding, that is, generating all instances of a parameterized action during a preprocessing phase. For some problems the number of ground actions is too high, causing a performance bottleneck. Building upon an existing approach, we present an enhanced method to split action schemas automatically during the grounding phase, to reduce the number of ground actions. First, we propose to exploit the structural knowledge of the problems to have a more informative dependency graph. Then, we suggest a better objective function to define and choose the best split. Finally, we present a more effective search to find it. We experimentally measure the impact of each of these improvements, and show that our approach significantly outperforms the state of the art.

Cite

CITATION STYLE

APA

Elahi, M., & Rintanen, J. (2024). Optimizing the Optimization of Planning Domains by Automatic Action Schema Splitting. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 38, pp. 20096–20103). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v38i18.29988

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free