π€ AI Summary
Symbolic Hierarchical Task Network (HTN) planners lack sufficient solvability for open-domain complex tasks, while large language models (LLMs) offer flexibility but lack formal correctness guarantees. Method: We propose ChatHTNβa novel framework that dynamically and rigorously interleaves approximate LLM-based reasoning (using ChatGPT) with symbolic HTN planning. At critical decomposition points, ChatGPT generates candidate subtasks; each decomposition step is then formally verified against HTN semantic constraints to ensure soundness. The result is an end-to-end hierarchical plan provably correct with respect to the domain model and goal specification. Contribution/Results: Implemented in open-source Python, all generated plans are mathematically proven to achieve their goals. Experiments demonstrate that ChatHTN significantly extends the applicability of HTN planning to open-domain tasks, substantially improving solvability and practicality of complex tasks without compromising formal reliability.
π Abstract
We introduce ChatHTN, a Hierarchical Task Network (HTN) planner that combines symbolic HTN planning techniques with queries to ChatGPT to approximate solutions in the form of task decompositions. The resulting hierarchies interleave task decompositions generated by symbolic HTN planning with those generated by ChatGPT. Despite the approximate nature of the results generates by ChatGPT, ChatHTN is provably sound; any plan it generates correctly achieves the input tasks. We demonstrate this property with an open-source implementation of our system.