Tight bounds for HTN planning with task insertion
Proceedings of the International Symposium on Combinatorial Search, 2015•ojs.aaai.org
Abstract Hierarchical Task Network (HTN) planning with task insertion (TIHTN planning) is a
variant of HTN planning. In HTN planning, the only means to alter task networks is to
decompose compound tasks. In TIHTN planning, tasks may also be inserted directly. In this
paper we provide tight complexity bounds for TIHTN planning along two axis: whether
variables are allowed and whether methods must be totally ordered.
variant of HTN planning. In HTN planning, the only means to alter task networks is to
decompose compound tasks. In TIHTN planning, tasks may also be inserted directly. In this
paper we provide tight complexity bounds for TIHTN planning along two axis: whether
variables are allowed and whether methods must be totally ordered.
Abstract
Hierarchical Task Network (HTN) planning with task insertion (TIHTN planning) is a variant of HTN planning. In HTN planning, the only means to alter task networks is to decompose compound tasks. In TIHTN planning, tasks may also be inserted directly. In this paper we provide tight complexity bounds for TIHTN planning along two axis: whether variables are allowed and whether methods must be totally ordered.
ojs.aaai.org
Showing the best result for this search. See all results