Conny Olz

According to our database, Conny Olz authored at least 7 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

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

Songtuan Lin, Conny Olz, Malte Helmert, Pascal Bercher

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements.

Conny Olz, Pascal Bercher

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning Tasks.

Conny Olz, Pascal Bercher

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022

Step-by-Step Task Plan Explanations Beyond Causal Links.

Felix Lindner, Conny Olz

Proceedings of the 31st IEEE International Conference on Robot and Human Interactive Communication, 2022

2021

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

Conny Olz, Susanne Biundo, Pascal Bercher

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

POP ≡ POCL, Right? Complexity Results for Partial Order (Causal Link) Makespan Minimization.

Pascal Bercher, Conny Olz

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Eliminating Redundant Actions in Partially Ordered Plans - A Complexity Analysis.

Conny Olz, Pascal Bercher

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019