Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Tight Bounds for HTN Planning with Task Insertion (Extended Abstract)<sup>∗</sup>

Thumbnail Image

Date

2015

Authors

Alford, Ron
Bercher, Pascal
Aha, David W.

Journal Title

Journal ISSN

Volume Title

Publisher

AAAI Press

Access Statement

Research Projects

Organizational Units

Journal Issue

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.

Description

Keywords

Citation

URI

https://hdl.handle.net/1885/733811273

Collections

ANU Research Publications

Source

Type

Conference paper

Book Title

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

Entity type

Publication

Access Statement

License Rights

DOI

10.1609/socs.v6i1.18347

Restricted until

DSpace software copyright © 2002-2026 LYRASIS