arXiv AI

Towards Numerical TOHTN Planning with SMT-based HTN-SAT Encoding

The paper introduces a method for numerical Totally-Ordered HTN (TOHTN) planning by extending standard SAT-based encodings with SMT to handle numeric fluents. It also presents a new benchmark suite for evaluating numerical TOHTN planning, providing a common basis for future research. Experimental results demonstrate that this straightforward encoding serves as a competitive baseline for the field.

arXiv AI
Sep 4

Lose the Order, Keep the Hierarchy: Deordering HTN Plans

The paper "Lose the Order, Keep the Hierarchy: Deordering HTN Plans" adapts two classical plan deordering techniques to the Hierarchical Task Network (HTN) planning framework, extending them to respect hierarchical decomposition constraints. The authors evaluate their methods on the IPC 2023 Partial-Order HTN benchmarks and compare them with Optiplan, an HTN planner that generates partially ordered plans directly. Results show a substantial reduction in ordering constraints, with a smaller but noticeable decrease in critical path length.

By Takudzwa Togarepi, Gaspard Quenard, Damien Pellier, Humbert Fiorino
arXiv AI
Sep 3

PIE-APT: Abductive Planning over Temporal Dynamic Knowledge Graphs via Incremental Reasoning

PIE-APT introduces a unified framework for abductive planning over Temporal Dynamic Knowledge Graphs (TDKGs) using two modules: PIE-Abducer, which performs incremental direct-derivation abduction, and PIE-APT, which interleaves backward‑chaining A* search with PIE-Abducer to generate action sequences and abductive assumptions. The approach operates natively on the expressive SROIQ Description Logic, leveraging an incremental reasoner to maintain decidability and bypass the Ramification Problem. Evaluation on four OWL benchmarks demonstrates qualitative superiority over classical planners and shows that the direct‑derivation method outperforms a Minimal Hitting Set baseline in abductive enrichment.

By Amir Hossein Sharafi, Alireza Shahbazi
arXiv AI
Aug 14

Exploiting Symbolic Heuristics for the Synthesis of Domain-Specific Temporal Planning Guidance using Reinforcement Learning

arXiv:2505. 13372v2 Announce Type: replace Abstract: Recent work investigated the use of Reinforcement Learning (RL) for the synthesis of heuristic guidance to improve the performance of temporal planners when a domain is fixed and a set of training problems (not plans) is given.

By Irene Brugnara, Alessandro Valentini, Andrea Micheli
arXiv Machine Learning
Sep 22

Subgoal Search For Complex Reasoning Tasks

arXiv:2108.11204v4 Announce Type: replace-cross Abstract: Humans excel in solving complex reasoning tasks through a mental process of moving from one idea to a related one. Inspired by this, we propo...

By Konrad Czechowski, Tomasz Odrzyg\'o\'zd\'z, Marek Zbysi\'nski, Micha{\l} Zawalski, Krzysztof Olejnik, Yuhuai Wu, {\L}ukasz Kuci\'nski, Piotr Mi{\l}o\'s