Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains
Songtuan Lin, Alban Grastien, Pascal Bercher
Abstract
Designing a planning domain is a difficult task in AI planning. Assisting tools are thus required if we want planning to be used more broadly. In this paper, we are interested in automatically correcting a flawed domain. In particular, we are concerned with the scenario where a domain contradicts a plan that is known to be valid. Our goal is to repair the domain so as to turn the plan into a solution. Specifically, we consider both grounded and lifted representations support for negative preconditions and show how to explore the space of repairs to find the optimal one efficiently. As an evidence of the efficiency of our approach, the experiment results show that all flawed domains except one in the benchmark set can be repaired optimally by our approach within one second.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4d5ac9a5-1edd-467e-a99c-ff65681a2804Cited by top-tier papers6
- Was Fixing This Really That Hard? On the Complexity of Correcting HTN DomainsSongtuan Lin, Pascal BercherAAAI 2023 · 10 citations
- NaRuto: Automatically Acquiring Planning Models from Narrative TextsRuiqi Li, Leyang Cui, Songtuan Lin, Patrik HaslumAAAI 2024 · 8 citations
- On Total-Order HTN Plan Verification with Method Preconditions - An Extension of the CYK Parsing AlgorithmSongtuan Lin, Gregor Behnke, Simona Ondrcková, Roman Barták et al.AAAI 2023 · 6 citations
- Told You That Will Not Work: Optimal Corrections to Planning Domains Using Counter-Example PlansSongtuan Lin, Alban Grastien, Rahul Shome, Pascal BercherAAAI 2025 · 5 citations
- On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan ExistenceSongtuan Lin, Conny Olz, Malte Helmert, Pascal BercherAAAI 2024 · 3 citations
Builds on1
Related papers
- Automated Repair of Totally-Ordered Hierarchical Task Network Domains via Context-Free Grammars with Large Language Model SupportDaniel Lutalo, Pascal BercherAAAI 2026
- On Succinct Groundings of HTN Planning ProblemsGregor Behnke, Daniel Höller, Alexander Schmid, Pascal Bercher et al.AAAI 2020 · 34 citations
- Generalized Planning with Positive and Negative ExamplesJavier Segovia-Aguas, Sergio Jiménez, Anders JonssonAAAI 2020 · 11 citations
- Abstract interpretation repairRoberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco RanzatoPLDI 2022 · 15 citations
- Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity AnalysisPascal Bachor, Gregor BehnkeAAAI 2024 · 5 citations
