Told You That Will Not Work: Optimal Corrections to Planning Domains Using Counter-Example Plans
Songtuan Lin, Alban Grastien, Rahul Shome, Pascal Bercher
摘要
Hardness of modeling a planning domain is a major obstacle for making automated planning techniques accessible. We developed a tool that helps modelers correct domains based on available information such as the known feasibility or infeasibility of certain plans. Designing model repair strategies that are capable of repairing flawed planning domains automatically has been explored in previous work to use positive plans (invalid in the given (flawed) domain but feasible in the true'' domain). In this work, we highlight the importance of and study counter-example negative plans (valid in the given (flawed) domain but infeasible in the true'' domain). Our approach automatically corrects a domain by finding an optimal repair set to the domain which turns all negative plans into non-solutions, in addition to making all positive plans solutions. Experiments indicate strong performance in the fast-downward benchmark suite with random errors. A handcrafted benchmark with domain flaws inspired by some practical applications also motivates the method's efficacy.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper1
相关 Paper
- Was Fixing This Really That Hard? On the Complexity of Correcting HTN DomainsSongtuan Lin, Pascal BercherAAAI 2023 · 被引用 10 次
- Automated Repair of Totally-Ordered Hierarchical Task Network Domains via Context-Free Grammars with Large Language Model SupportDaniel Lutalo, Pascal BercherAAAI 2026
- Generalized Planning with Positive and Negative ExamplesJavier Segovia-Aguas, Sergio Jiménez, Anders JonssonAAAI 2020 · 被引用 11 次
- Bounded Exhaustive Search of Alloy Specification RepairsSimón Gutiérrez Brida, Germán Regis, Guolong Zheng, Hamid Bagheri 等ICSE 2021 · 被引用 6 次
- Learning Safe Numeric Action ModelsArgaman Mordoch, Brendan Juba, Roni SternAAAI 2023 · 被引用 6 次
