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.

On the Verification of Totally-Ordered HTN Plans

Thumbnail Image

Date

2021-08-06

Authors

Bartak, Roman
Ondrckova, Simona
Behnke, Gregor
Bercher, Pascal

Journal Title

Journal ISSN

Volume Title

Publisher

Access Statement

Research Projects

Organizational Units

Journal Issue

Abstract

Verifying HTN plans is an intractable problem with two existing approaches to solve the problem. One technique is based on compilation to SAT. Another method is using parsing, and it is currently the fastest technique for verifying HTN plans. In this paper, we propose an extension of the parsingbased approach to verify totally-ordered HTN plans more efficiently. This problem is known to be tractable if no state constraints are included, and we show theoretically and empirically that the modified parsing approach achieves better performance than the currently fastest HTN plan verifier when applied to totally-ordered HTN plans.

Description

Keywords

Citation

URI

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

Collections

ANU Research Publications

Source

Type

Conference paper

Book Title

Entity type

Publication

Access Statement

License Rights

DOI

Restricted until

DSpace software copyright © 2002-2026 LYRASIS