Automated Repair of Totally-Ordered Hierarchical Task Network Domains via Context-Free Grammars with Large Language Model Support

Authors

  • Daniel Lutalo Australian National University
  • Pascal Bercher Australian National University

DOI:

https://doi.org/10.1609/aaai.v40i43.40951

Abstract

Repairing flawed domain models remains a critical challenge in AI planning, with few effective techniques available. We propose a novel approach for repairing totally ordered hierarchical task network (TO-HTN) models with missing actions, guided by a plan that must be valid for the repaired model. This problem has only one previously documented approach, which relies on complex re-encoding that's solved via TO-HTN planning. In contrast, our approach translates the repair task into a context-free grammar repair problem and leverages a large language model (LLM) to identify and insert relevant actions directly, simplifying the repair process. We evaluate our approach on established benchmarks and demonstrate substantially improved results over the prior approach, achieving nearly three times the number of instances solved, and nearly solving all instances of domains in which the previous approach solved zero. Importantly, we mask all natural language hints, such as action names, forcing the LLM to simulate reasoning and planning, and mitigating the risk of data leakage from its training corpus.

Downloads

Published

2026-03-14

How to Cite

Lutalo, D., & Bercher, P. (2026). Automated Repair of Totally-Ordered Hierarchical Task Network Domains via Context-Free Grammars with Large Language Model Support. Proceedings of the AAAI Conference on Artificial Intelligence, 40(43), 36316–36324. https://doi.org/10.1609/aaai.v40i43.40951

Issue

Section

AAAI Technical Track on Planning, Routing, and Scheduling