Details zu Publikationen

Programmatic Task Network Planning

verfasst von
Felix Mohr, Theodor Lettmann, Eyke Hüllermeier, Marcel Dominik Wever
Abstract

Many planning problems benefit from extensions of classical planning formalisms and modeling techniques, or even require such extensions. Alternatives such as functional STRIPS or planning modulo theories have therefore been proposed in the past. Somewhat surprisingly, corresponding extensions are not available for hierarchical planning, despite their potential usefulness in applications like automated service composition. In this paper, we present programmatic task networks (PTN), a formalism that extends classical HTN planning in three ways. First, we allow both operations and methods to have outputs instead of only inputs. Second, formulas may contain interpreted terms, in particular interpreted predicates, which are evaluated by a theory realized in an external library. Third, PTN planning allows for a second type of tasks, called oracle tasks, which are not resolved by the planner itself but by external libraries. For the purpose of illustration and evaluation, the approach is applied to a real-world use case in the field of automated service composition.

Externe Organisation(en)
Universität Paderborn
Typ
Aufsatz in Konferenzband
Seiten
31-39
Anzahl der Seiten
9
Publikationsdatum
06.2018
Publikationsstatus
Veröffentlicht
Peer-reviewed
Ja
Elektronische Version(en)
https://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop08/docs/Mohr18ProgrammaticPlanning.pdf (Zugang: Offen)