Explainable Planner Selection for Classical Planning
Patrick Ferber, Jendrik Seipp
2022年份
5被引次数
1顶会引用
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper1
相关 Paper
- State Encodings for GNN-Based Lifted PlannersRostislav Horcík, Gustav Sír, Vítezslav Simek, Tomás PevnýAAAI 2025 · 被引用 3 次
- Explainable Neural Networks with Guarantee: A Sparse Estimation ApproachAntoine Ledent, Peng LiuAAAI 2025 · 被引用 1 次
- Planning with Learned Object Importance in Large Problem Instances using Graph Neural NetworksTom Silver, Rohan Chitnis, Aidan Curtis, Joshua B. Tenenbaum 等AAAI 2021 · 被引用 97 次
- Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language ModelsSamuel Marks, Can Rager, Eric J. Michaud, Yonatan Belinkov 等ICLR 2025
- Learning Geometric Reasoning Networks For Robot Task And Motion PlanningSmail Ait Bouhsain, Rachid Alami, Thierry SiméonICLR 2025
