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 Lifted HTN Plan Verification and Bounded Plan Existence

Thumbnail Image

Date

2025-09-16

Authors

Lauer, Pascal
Lin, Songtuan
Bercher, Pascal

Journal Title

Journal ISSN

Volume Title

Publisher

Access Statement

Research Projects

Organizational Units

Journal Issue

Abstract

Plan verification is a canonical problem within any planning setting to ensure correctness. This problem is closely linked to the bounded plan existence problem. We analyze the complexity of these problems on lifted representations for Hierarchical Task Network (HTN) Planning. On top of the general analysis, we impose constraints on method orderings and the amount of tasks that methods decompose to. This pinpoints subclasses with lower complexity. Our results confirm the existence of more efficient algorithms when operating on the lifted, instead of grounded, representation.

Description

Keywords

Citation

URI

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

Collections

ANU Research Publications

Source

Proceedings International Conference on Automated Planning and Scheduling, ICAPS

Type

Conference paper

Book Title

Entity type

Publication

Access Statement

License Rights

DOI

10.1609/icaps.v35i1.36102

Restricted until

DSpace software copyright © 2002-2026 LYRASIS