Abstract
Hybrid Planning combines Hierarchical Task Network (HTN) planning with concepts known from Partial-Order Causal-Link (POCL) planning. We introduce novel heuristics for Hybrid Planning that estimate the number of necessary modifications to turn a partial plan into a solution. These estimates are based on the task decomposition graph that contains all decompositions of the abstract tasks in the planning domain. Our empirical evaluation shows that the proposed heuristics can significantly improve planning performance.
Cite
CITATION STYLE
Bercher, P., Keen, S., & Biundo, S. (2014). Hybrid planning heuristics based on task decomposition graphs. In Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014 (Vol. 2014-January, pp. 35–43). AAAI press. https://doi.org/10.1609/socs.v5i1.18323
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
