Conny Olz — accepted AI-conference papers

2024

On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence

Songtuan Lin, Conny Olz, Malte Helmert, Pascal Bercher

AAAI 2024technical

In this paper we study the computational complexity of several reasoning tasks centered around the bounded plan existence problem. We do this for standard classical planning and hierarchical task network (HTN) planning and each for a grounded and a lifted representation. Whereas bounded plan existen…

Cited by 4 Source ↗PDF ↗Scholar ↗

2021

Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks – A Complexity Analysis

Conny Olz, Susanne Biundo, Pascal Bercher

AAAI 2021technical

In Hierarchical Task Network (HTN) planning, compound tasks need to be refined into executable (primitive) action sequences. In contrast to their primitive counterparts, compound tasks do not specify preconditions or effects. Thus, their implications on the states in which they are applied are not e…

Cited by 24 Source ↗PDF ↗Scholar ↗