From PCP to HTN Planning Through CFGs

Höller, Daniel; Lin, Songtuan; Erol, Kutluhan; Bercher, Pascal

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.

From PCP to HTN Planning Through CFGs

Date

2021

Authors

Höller, Daniel

Lin, Songtuan

Erol, Kutluhan

Bercher, Pascal

Abstract

The International Planning Competition in 2020 was the first one for a long time to host tracks on HTN planning. The used benchmark set included a domain describing the undecidable Post Correspondence Problem (PCP). In this paper we describe the two-step process applied to generate HTN problems based on PCP instances. It translates the PCP into a grammar intersection problem of two context-free languages, which is then encoded into an HTN problem.

URI

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

Collections

ANU Research Publications

Type

Conference paper

Entity type

Publication

Full item page

Cultural advice

From PCP to HTN Planning Through CFGs

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Access Statement

Research Projects

Organizational Units

Journal Issue

Abstract

Description

Keywords

Citation

URI

Collections

Source

Type

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until