Explainable Planner Selection for Classical Planning
Patrick Ferber, Jendrik Seipp
Abstract
Since no classical planner consistently outperforms all others, it is important to select a planner that works well for a given classical planning task. The two strongest approaches for planner selection use image and graph convolutional neural networks. They have the drawback that the learned models are complicated and uninterpretable. To obtain explainable models, we identify a small set of simple task features and show that elementary and interpretable machine learning techniques can use these features to solve roughly as many tasks as the complex approaches based on neural networks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on1
Related papers
- State Encodings for GNN-Based Lifted PlannersRostislav Horcík, Gustav Sír, Vítezslav Simek, Tomás PevnýAAAI 2025 · 3 citations
- Explainable Neural Networks with Guarantee: A Sparse Estimation ApproachAntoine Ledent, Peng LiuAAAI 2025 · 1 citation
- Planning with Learned Object Importance in Large Problem Instances using Graph Neural NetworksTom Silver, Rohan Chitnis, Aidan Curtis, Joshua B. Tenenbaum et al.AAAI 2021 · 97 citations
- Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language ModelsSamuel Marks, Can Rager, Eric J. Michaud, Yonatan Belinkov et al.ICLR 2025
- Learning Geometric Reasoning Networks For Robot Task And Motion PlanningSmail Ait Bouhsain, Rachid Alami, Thierry SiméonICLR 2025
