Optimizing the Optimization of Planning Domains by Automatic Action Schema Splitting
Mojtaba Elahi, Jussi Rintanen
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper1
相关 Paper
- On Succinct Groundings of HTN Planning ProblemsGregor Behnke, Daniel Höller, Alexander Schmid, Pascal Bercher 等AAAI 2020 · 被引用 34 次
- An Effective Polynomial Technique for Compiling Conditional Effects AwayAlfonso Emilio Gerevini, Francesco Percassi, Enrico ScalaAAAI 2024 · 被引用 5 次
- Automatic Selection of Macro-Events for Heuristic-Search Temporal PlanningAlessandro La Farciola, Alessandro Valentini, Andrea MicheliAAAI 2025
- Abstract Action Scheduling for Optimal Temporal Planning via OMTStefan Panjkovic, Andrea MicheliAAAI 2024 · 被引用 3 次
- Homomorphisms of Lifted Planning Tasks: The Case for Delete-Free Relaxation HeuristicsRostislav Horcík, Daniel Fiser, Álvaro TorralbaAAAI 2022 · 被引用 6 次
