@article{10.1007/s10458-025-09705-9, 
year = {2025}, 
title = {{Hypertension and total-order forward decomposition optimizations}}, 
author = {Magnaguagno, Maurício Cecílio and Meneguzzi, Felipe and Silva, Lavindra de}, 
journal = {Autonomous Agents and Multi-Agent Systems}, 
issn = {1387-2532}, 
doi = {10.1007/s10458-025-09705-9}, 
abstract = {{Hierarchical Task Network (HTN) planners generate plans using a decomposition process with extra domain knowledge to guide search towards a planning task. Domain experts develop such domain knowledge through recipes of how to decompose higher level tasks, specifying which tasks can be decomposed and under what conditions. In most realistic domains, such recipes contain recursions, i.e., tasks that can be decomposed into other tasks that contain the original task. Such domains require that either the domain expert tailor such domain knowledge to the specific HTN planning algorithm, or an algorithm that can search efficiently using such domain knowledge. By leveraging a three-stage compiler design we can easily support more language descriptions and preprocessing optimizations that when chained can greatly improve runtime efficiency in such domains. In this paper we evaluate such optimizations with the HyperTensioN HTN planner, winner of the HTN IPC 2020 total-order track.}}, 
pages = {24}, 
number = {1}, 
volume = {39}
}