Tight Bounds for HTN Planning with Task Insertion (Extended Abstract)∗

Ron Alford; Pascal Bercher; David W. Aha

doi:10.1609/socs.v6i1.18347

Tight Bounds for HTN Planning with Task Insertion (Extended Abstract)^∗

Ron Alford
, Pascal Bercher
, David W. Aha

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › peer-review

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.

Original language	English
Title of host publication	Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
Editors	Levi Lelis, Roni Stern
Publisher	AAAI Press
Pages	221-222
Number of pages	2
Volume	6
Edition	1
ISBN (Electronic)	9781577357322
DOIs	https://doi.org/10.1609/socs.v6i1.18347
Publication status	Published - 2015
Event	8th Annual Symposium on Combinatorial Search, SoCS 2015 - Ein Gedi, Israel Duration: 11 Jun 2015 → 13 Jun 2015

Publication series

Name	Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
Volume	2015-January

Conference

Conference	8th Annual Symposium on Combinatorial Search, SoCS 2015
Country/Territory	Israel
City	Ein Gedi
Period	11/06/15 → 13/06/15

Access to Document

10.1609/socs.v6i1.18347

Cite this

Alford, R., Bercher, P., & Aha, D. W. (2015). Tight Bounds for HTN Planning with Task Insertion (Extended Abstract)^∗. In L. Lelis, & R. Stern (Eds.), Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015 (1 ed., Vol. 6, pp. 221-222). (Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015; Vol. 2015-January). AAAI Press. https://doi.org/10.1609/socs.v6i1.18347

@inproceedings{0cd9b5f731c84e06a7f23fc493f9c345,

title = "Tight Bounds for HTN Planning with Task Insertion (Extended Abstract)∗",

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.",

author = "Ron Alford and Pascal Bercher and Aha, \{David W.\}",

note = "Publisher Copyright: Copyright {\textcopyright} 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 8th Annual Symposium on Combinatorial Search, SoCS 2015 ; Conference date: 11-06-2015 Through 13-06-2015",

year = "2015",

doi = "10.1609/socs.v6i1.18347",

language = "English",

volume = "6",

series = "Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015",

publisher = "AAAI Press",

pages = "221--222",

editor = "Levi Lelis and Roni Stern",

booktitle = "Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015",

edition = "1",

}

Alford, R, Bercher, P & Aha, DW 2015, Tight Bounds for HTN Planning with Task Insertion (Extended Abstract)^∗. in L Lelis & R Stern (eds), Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015. 1 edn, vol. 6, Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015, vol. 2015-January, AAAI Press, pp. 221-222, 8th Annual Symposium on Combinatorial Search, SoCS 2015, Ein Gedi, Israel, 11/06/15. https://doi.org/10.1609/socs.v6i1.18347

Tight Bounds for HTN Planning with Task Insertion (Extended Abstract)^∗. / Alford, Ron; Bercher, Pascal; Aha, David W.
Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015. ed. / Levi Lelis; Roni Stern. Vol. 6 1. ed. AAAI Press, 2015. p. 221-222 (Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015; Vol. 2015-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › peer-review

TY - GEN

T1 - Tight Bounds for HTN Planning with Task Insertion (Extended Abstract)∗

AU - Alford, Ron

AU - Bercher, Pascal

AU - Aha, David W.

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85048680414

U2 - 10.1609/socs.v6i1.18347

DO - 10.1609/socs.v6i1.18347

M3 - Conference Paper

AN - SCOPUS:85048680414

VL - 6

T3 - Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015

SP - 221

EP - 222

BT - Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015

A2 - Lelis, Levi

A2 - Stern, Roni

PB - AAAI Press

T2 - 8th Annual Symposium on Combinatorial Search, SoCS 2015

Y2 - 11 June 2015 through 13 June 2015

ER -