← Back to all news
arXiv AI By Takudzwa Togarepi, Gaspard Quenard, Damien Pellier, Humbert Fiorino

Lose the Order, Keep the Hierarchy: Deordering HTN Plans

Read the original on arXiv AI →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv AI
Sep 4

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.

By Gaspard Quenard, Takudzwa Togarepi, Damien Pellier, Humbert Fiorino
benchmarks
More like this →
arXiv AI
Sep 16

Execution Flexibility in Automated Planning: A Comparative Evaluation of Deordering and Reordering Strategies

The paper evaluates strategies for increasing plan‑execution flexibility by converting sequential plans into partial‑order plans through deordering and reordering. It compares block deordering methods, which restructure causal dependencies, with MaxSAT‑based approaches that optimize within existing causal structures. The study finds that block deordering consistently outperforms MaxSAT in both effectiveness and efficiency, offering anytime solutions and higher flexibility gains per computation time.

By Md. Monjurul Islam, Sabah Binte Noor, Fazlul Hasan Siddiqui, Gahangir Hossain
benchmarks
More like this →
arXiv AI
Jul 29

Finding Optimal Cost-Bounded Plan Reductions: Refined Model

arXiv:2607. 25484v1 Announce Type: new Abstract: In some real applications a plan may later become unfeasible due to newly imposed budget constraints, yet, at the same time, using only the original actions of the plan and their order is mandatory.

By Martha Del Toro, Raquel Fuentetaja, Angel Garc\'ia-Olaya
More like this →